n = int(input())
mod = 998244353

inv2 = pow(2, mod - 2, mod)
DP = [[0 for _ in range(2 * n + 1)] for _ in range(2 * n + 1)]
DP[0][0] = 1
for i in range(2 * n + 1):
    for j in range(2 * n + 1):
        if i >= 1 and j >= 1:
            DP[i][j] += DP[i - 1][j - 1] * ((i - 1) * (j - 1) + 1) % mod
            DP[i][j] %= mod
        if i >= 2:
            DP[i][j] += DP[i - 2][j] * (i - 1) * (i - 2) % mod * inv2 % mod
            DP[i][j] %= mod
        if j >= 2:
            DP[i][j] += DP[i][j - 2] * (j - 1) * (j - 2) % mod * inv2 % mod
            DP[i][j] %= mod
for i in range(2 * n + 1):
    print(DP[i][2 * n - i])