import sys
from itertools import permutations
from heapq import heappop,heappush
from collections import deque
import random
import bisect

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

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


mod = 998244353
N = 2*10**5
g1 = [1]*(N+1)
g2 = [1]*(N+1)
inverse = [1]*(N+1)

for i in range( 2, N + 1 ):
    g1[i]=( ( g1[i-1] * i ) % mod )
    inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0

def solve(N):
    dp = [0] * (2*N+1)
    dp[0] = 1
    for i in range(N):
        ndp = [0] * (2*N+1)
        for j in range(2*i+1):
            ndp[j+2] += dp[j] * j*(j+1)//2 % mod
            ndp[j+2] %= mod

            ndp[j] += dp[j] * ((2*i-j)*(2*i-j+1)//2) % mod
            ndp[j] %= mod

            ndp[j+1] += dp[j] * (1 + j*(2*i-j)) % mod
            ndp[j+1] %= mod
        dp = ndp
    
    return dp

N = int(input())
print(*solve(N),sep="\n")