Given is a string $S$. How many different strings can be obtained as a permutation of a non-empty, not necessarily contiguous subsequence of $S$?
Since the count can be enormous, print it modulo $998244353$.

Input is given from Standard Input in the following format:
$S$

Print the number of different strings that can be obtained as a permutation of a subsequence of $S$, modulo $998244353$.

$S$ is a string of length $1$ and $5000$ (inclusive) consisting of lowercase English letters.

8

There are $8$ different strings that can be obtained as a permutation of a subsequence of $S:\ \text{a, b, aa, ab, ba, aab, aba, baa}$.