n = int(input())
mod = 998244353

C = [0 for _ in range(2 * n)]
a = 1
d = 0
f = 10
while a - d < 2 * n:
    C[a - d] += 1
    a += 1
    if a % f == 0:
        d += 1
        f *= 10
DP = [[0 for _ in range(2 * n)] for _ in range(n + 1)]
DP[0][0] = 1
for i in range(n):
    for j in range(2 * n):
        for k in range(1, 2 * n):
            if j + k < 2 * n:
                DP[i + 1][j + k] += DP[i][j] * C[k]
                DP[i + 1][j + k] %= mod
print(DP[-1][-1])