class CP:
    def __init__(self, N):
        self.fact = [1]*(N+1)
        self.fact_inv = [1]*(N+1)
        for i in range(2, N+1):
            self.fact[i] = self.fact[i-1]*i%MOD
        self.fact_inv[N] = pow(self.fact[N], -1, MOD)
        for i in reversed(range(1, N)):
            self.fact_inv[i] = self.fact_inv[i+1]*(i+1)%MOD
    def C(self, N, K):
        if N < 0 or K < 0 or N < K:
            return 0
        return self.fact[N]*self.fact_inv[K]%MOD*self.fact_inv[N-K]%MOD
    def P(self, N, K):
        if N < 0 or K < 0 or N < K:
            return 0
        return self.fact[N]*self.fact_inv[N-K]%MOD
    def H(self, N, K):
        if N < 0 or K < 0:
            return 0
        if N == K == 0: return 1
        return self.C(N+K-1, K)

N = input()

MOD = 998244353

cp = CP(len(N))
L = len(N)
C = [0]*10
for n in N:
    C[int(n)] += 1

ans = 0
for i in range(1, 10):
    if C[i] == 0:
        continue
    SUM = 1
    S = 0
    for j in range(10):
        if i != j:
            SUM *= cp.C(L-1-S, C[j])
            SUM %= MOD
            S += C[j]
        else:
            SUM *= cp.C(L-1-S, C[j]-1)
            SUM %= MOD
            S += C[j]-1
    ans += SUM
    ans %= MOD

print(ans)