def nPr(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    return g1[n] * g2[n-r] % mod

def nCr(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return (g1[n] * g2[r] % mod) * g2[n-r] % mod

import sys
input = sys.stdin.readline
MOD = 998244353
N = int(input())
M = 2*N+1

g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
fact = [1, 1]
fact_inv = [1, 1]

for i in range( 2, M + 1 ):
    g1.append( ( g1[-1] * i ) % MOD )
    inverse.append( ( -inverse[MOD % i] * (MOD//i) ) % MOD )
    g2.append( (g2[-1] * inverse[-1]) % MOD )
    fact.append( (fact[-1] * i) % MOD )
    fact_inv.append(fact_inv[-1] * inverse[-1] % MOD)

dp = [[0 for _ in range(M)] for _ in range(M)]
dp[0][0] = 1
for i in range(M):
    for j in range(M):
        if dp[i][j]==0:
            continue
        if i+2<M:
            dp[i+2][j] += dp[i][j] * nCr(i+1, 2, MOD) % MOD
            dp[i+2][j] %= MOD
        if j+2<M:
            dp[i][j+2] += dp[i][j] * nCr(j+1, 2, MOD) % MOD
            dp[i][j+2] %= MOD
        if i+1<M and j+1<M:
            dp[i+1][j+1] += dp[i][j] * (i*j+1) % MOD
            dp[i+1][j+1] %= MOD
#print(dp)
for k in range(M):
    print(dp[k][M-k-1])