n = int(input())
dp = [0] * (2 * n)
dp[0] = 1
mod = 998244353
for i in range(n):
    nx = [0] * (2 * n)
    for s in range(2*n):
        for a in range(1,2*n):
            b = a -(len(list(str(a))) -1)
            if s + b <= 2 * n -1:
                nx[s + b]  += dp[s]
                nx[s+b] %= mod
    dp = nx
print(dp[-1])