M=998244353
s=input()
n=len(s)
c=[s.count(str(i)) for i in range(10)]
N=n
fa=[1]
for i in range(1,N+1):
  fa+=[fa[-1]*i%M]
fb=[pow(fa[N],M-2,M)]
for i in reversed(range(1,N+1)):
  fb+=[fb[-1]*i%M]
fb.reverse()
fc=lambda n,k:fa[n]*fb[k]*fb[n-k]%M if n>=k>=0 else 0
a1=fa[n]
for i in range(10):
  a1*=fb[c[i]]
  a1%=M
a2=0
if c[0]>0:
  a2=fa[n-1]
  for i in range(10):
    a2*=fb[c[i]-(i==0)]
    a2%M
print((a1-a2)%M)