mod=998244353
class Comb:
    def __init__(self, lim:int, mod:int = mod):
        """
        mod : prime
        """
        self.fac = [1]*(lim+1)
        self.finv = [1]*(lim+1)
        self.mod = mod
        for i in range(2,lim+1):
            self.fac[i] = self.fac[i-1]*i%self.mod
        self.finv[lim] = pow(self.fac[lim],-1,mod)
        for i in range(lim,2,-1):
            self.finv[i-1] = self.finv[i]*i%self.mod
    
    def C(self, a, b):
        assert b >= 0, "The second argument is negative."
        if a < b: return 0
        if a < 0: return 0
        return self.fac[a]*self.finv[b]%self.mod*self.finv[a-b]%self.mod
    
    def P(self, a, b):
        assert b >= 0, "The second argument is negative."
        if a < b: return 0
        if a < 0: return 0
        return self.fac[a]*self.finv[a-b]%self.mod
    
    def H(self, a, b): return self.C(a+b-1,b)
    def F(self, a): return self.fac[a]
    def Fi(self, a): return self.finv[a]

comb = Comb(1000000, mod)

N=input()
d=[0]*10
for i in range(len(N)):
    d[int(N[i])]+=1
ans=0
n = len(N)
for i in range(1,10):
    if d[i]==0:
        continue
    ans_d = comb.F(n-1)
    for j in range(10):
        if i==j:
            ans_d *= comb.Fi(d[j]-1)
        else:
            ans_d *= comb.Fi(d[j])
        ans_d %= mod
    ans += ans_d
    ans %= mod
print(ans)