from functools import cache
MOD = 998244353
@cache
def fact(n):
    if n == 0:
        return 1
    return n * fact(n - 1) % 998244353

@cache
def fact_inv(n):
    return pow(fact(n), MOD - 2, MOD)

N = input()
L = len(N)
cnt = [0] * 10

for n in N:
    cnt[int(n)] += 1

ans = fact(L)
for c in cnt:
    ans = ans * fact_inv(c) % MOD

if cnt[0] > 0:
    bad_ans = fact(L - 1)
    bad_ans = bad_ans * fact_inv(cnt[0]-1) % MOD
    for c in cnt[1:]:
        bad_ans = bad_ans * fact_inv(c) % MOD
    ans = (ans - bad_ans) % MOD

print(ans)