def cmb(n, r, p):#nCr mod p
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

p = 998244353
binomial_max = 10 ** 6  # N は必要分だけ用意する
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]

for i in range(2, binomial_max + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)
N = list(input())
zero = N.count("0")
cnt_l = [N.count(str(i)) for i in range(10)]
pt = fact[len(N)]
for i in range(10):
    pt *= factinv[cnt_l[i]]
    pt %= p
#print(pt)
for i in range(1,zero+1):

    rest_zero = zero-i
    pt2 = 0
    for j in range(1,10):
        if cnt_l[j] > 0:
            tmp = fact[len(N)-1-i]
            tmp *= factinv[rest_zero]
            for k in range(1,10):
                if j == k:
                    tmp *= factinv[cnt_l[k]-1]
                else:
                    tmp *= factinv[cnt_l[k]]
            pt2 += tmp
            #print(j,tmp)
    pt -= pt2
    pt %= p
print(pt)