MOD = 998244353

def solve(s):
    n = len(s)
    equal = [0] * (1 << 10)
    small = [0] * (1 << 10)
    
    num = int(s[0])
    for x in range(1, num):
        small[1 << x] += 1
    equal[1 << num] += 1
    
    for i in range(1, n):
        equal_old = equal[:]
        small_old = small[:]
        equal = [0] * (1 << 10)
        small = [0] * (1 << 10)
        
        num = int(s[i])
        for bit in range(1 << 10):
            for x in range(num):
                small[bit ^ (1 << x)] = (small[bit ^ (1 << x)] + equal_old[bit]) % MOD
            equal[bit ^ (1 << num)] = (equal[bit ^ (1 << num)] + equal_old[bit]) % MOD
            for x in range(10):
                small[bit ^ (1 << x)] = (small[bit ^ (1 << x)] + small_old[bit]) % MOD
        
        for x in range(1, 10):
            small[1 << x] = (small[1 << x] + 1) % MOD
    
    return (equal[0] + small[0]) % MOD

if __name__ == "__main__":
    s = input().strip()
    print(solve(s))