import sys

sys.setrecursionlimit(10 ** 5)

n = input()

M = 998244353

cache = {}

def count(num, i, tight, nzseen, mask):
    if i >= len(num):
        return int(mask == 0 and nzseen)
    key = (i, tight, nzseen, mask)
    if key in cache:
        return cache[key]
    maxd = 9
    if tight:
        maxd = int(num[i])
    res = 0
    for d in range(maxd + 1):
        newnzseen = nzseen or d != 0
        res += count(num, i + 1, tight and d == maxd, newnzseen, mask ^ (1 << d) if newnzseen else mask)
        res %= M
    cache[key] = res
    return res
    
print(count(n, 0, True, False, 0))