import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
#n = int(input())
#a = list(map(int,input().split()))
#a = []
#s = input()
#n,m = map(int,input().split())
#for i in range(n):
#    a.append(list(map(int,input().split())))
class comb():
    def __init__(self,n,mod):
        self.fact = [0] * (n+1)
        self.fact_inv = [0] * (n+1)
        self.mod = mod

        self.fact[1] = 1
        self.fact_inv[1] = pow(1,mod-2,mod)
        self.fact[0] = 1
        self.fact_inv[0] = 1

        for i in range(2,n+1):
            self.fact[i] = (self.fact[i-1] * i) % mod
        m = min(n,mod-1)
        self.fact_inv[m] = pow(self.fact[m],mod-2,mod)
        for i in reversed(range(2,m)):
            self.fact_inv[i] = (self.fact_inv[i+1] * (i+1)) % mod
            #print(i,pow(self.fact[i],mod-2,mod) , self.fact_inv[i])
            #assert pow(self.fact[i],mod-2,mod) == self.fact_inv[i]
    def ncr(self,n,r):
        if n-r < 0:
            return 0
        return (self.fact[n] * self.fact_inv[r] * self.fact_inv[n-r]) % self.mod
    def nhr(self,n,r):
        return self.ncr(n+r-1,r)
mod = 998244353
a = list(input().rstrip())
c = collections.Counter(a)
ans = 1
co = comb(1000000,mod)
n = len(a)
ans *= co.fact[n]
for i in c:
    ans *= co.fact_inv[c[i]]
    ans %= mod
if c['0'] >= 1:
    c['0'] -= 1
    temp = co.fact[n-1]
    for i in c:
        temp *= co.fact_inv[c[i]]
        temp %= mod
    ans -= temp
print(ans % mod)