## https://yukicoder.me/problems/no/1924

MOD = 998244353



def main():
    N = input()

    # Nよりも桁数が小さいケースを考える
    dp = [[0] * 1024 for _ in range(len(N))]
    dp[0][0] = 1
    answer = 0
    for i in range(1, len(N)):

        for p in range(1, 10):
            answer += dp[i - 1][(1 << p)]
            answer %= MOD
        
        for p in range(10):
            for bit in range(1024):
                new_bit = bit ^ (1 << p)
                dp[i][new_bit] += dp[i - 1][bit]
                dp[i][new_bit] %= MOD
    
    # Nと同じ桁数のものを考える
    b = 0
    for i in range(len(N)):
        n = int(N[i])

        if i == 0:
            for m in range(1, n):
                answer += dp[len(N) - 1 - i][(1 << m)]
                answer %= MOD
        else:
            for m in range(n):
                answer += dp[len(N) - 1 - i][(1 << m) ^ b]
                answer %= MOD

        b ^= (1 << n)
    
    if b == 0:
        answer += 1
        answer %= MOD
    
    print(answer)




    


        




if __name__ == '__main__':
    main()