from collections import Counter


class ModComb:
    def __init__(self, n: int, mod: int):
        fact = [0] * (n+1)
        fact[0] = 1
        for i in range(1, n+1):
            fact[i] = i * fact[i-1] % mod

        ifact = [0] * (n+1)
        ifact[n] = pow(fact[n], mod-2, mod)
        for i in range(n, 0, -1):
            ifact[i-1] = ifact[i] * i % mod
        self.fact = fact
        self.ifact = ifact
        self.mod = mod

    def __call__(self, n: int, k: int) -> int:
        if n < 0 or k > n: return 0
        return (self.fact[n] * self.ifact[k] % self.mod) * self.ifact[n-k] % self.mod


MOD = 998244353
N = input()

mcomb = ModComb(2 * 10**5, MOD)
ds = [int(c) for c in N]
freq = Counter(ds)

ans = 0
for i in range(1, 10):
    if freq[i] == 0: continue
    freq[i] -= 1

    tot = sum(freq.values())
    res = mcomb.fact[tot]
    for j in range(10):
        if freq[j] == 0: continue
        res *= mcomb.ifact[freq[j]]
        res %= MOD

    ans += res
    ans %= MOD
    freq[i] += 1

print(ans)