n = int(input())
mod = 998244353

### for bigger prime 
N = n*2+5
fact = [1]*N
finv = [1]*N
 
for i in range(2,N):
    fact[i] = (fact[i-1]*i)%mod
finv[-1] = pow(fact[-1],mod-2,mod)
for i in range(1,N)[::-1]:
    finv[i-1] = (finv[i]*i)%mod

def nCr(n,r):
    if r > n:
        return 0
    else: 
        return fact[n]*finv[r]%mod*finv[n-r]%mod

dp = [[0]*(2*n+1) for i in range(2*n+1)]

dp[0][0] = 1

for li in range(2*n+1):
    for ri in range(2*n+1):
        if dp[li][ri] == 0:
            continue

        if li+1 <= 2*n and ri + 1 <= 2*n:
            dp[li+1][ri+1] += (1 + li * ri) * dp[li][ri]
            dp[li+1][ri+1] %= mod

        if li+2 <= 2*n:
            dp[li+2][ri] += nCr(li+1,2) * dp[li][ri]
            dp[li+2][ri] %= mod

        if ri+2 <= 2*n:
            dp[li][ri+2] += nCr(ri+1,2) * dp[li][ri]
            dp[li][ri+2] %= mod

for i in range(2*n+1):
    print(dp[i][2*n-i])