class CP:
    def __init__(self, N):
        self.fact = [1]
        self.fact_inv = [1]
        for i in range(1, N+1):
            self.fact.append((self.fact[-1]*i)%MOD)
            self.fact_inv.append(pow(self.fact[-1], -1, MOD))
    def C(self, N, K):
        if N >= K:
            return self.fact[N]*self.fact_inv[K]%MOD*self.fact_inv[N-K]%MOD
        else:
            return 0
    def P(self, N, K):
        if N >= K:
            return self.fact[N]*self.fact_inv[N-K]%MOD
        else:
            return 0

N = int(input())

MOD = 998244353

dp = [[0]*(N*2+1) for _ in range(N*2+1)]
dp[0][0] = 1
cp = CP(10**5)
for i in range(N*2+1):
    for j in range(N*2+1):
        if dp[i][j] == 0:
            continue
        if i+1 <= N*2 and j+1 <= N*2:
            dp[i+1][j+1] += dp[i][j]
            dp[i+1][j+1] %= MOD
        if 1 <= i and i+2 <= N*2:
            dp[i+2][j] += dp[i][j]*cp.C(i+1, 2)%MOD
            dp[i+2][j] %= MOD
        if 1 <= j and j+2 <= N*2:
            dp[i][j+2] += dp[i][j]*cp.C(j+1, 2)%MOD
            dp[i][j+2] %= MOD
        if 1 <= i and 1 <= j and i+1 <= N*2 and j+1 <= N*2:
            dp[i+1][j+1] += dp[i][j]*i*j%MOD
            dp[i+1][j+1] %= MOD

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