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

K = int(input())

N = 200

n_pow = [pow(i,K,mod) for i in range(N+1)]

res = [0] * (N+1)
for d1 in range(1,N+1):
    for d2 in range(N+1):
        for d3 in range(N+1):
            n = 3 * d1 + 2 * d2 + d3
            if n > N:
                continue

            if n == 4:
                print(d1,d2,d3)

            res[n] += (((d3+1) * (d2+d3+2) % mod) * ((d2+1) * g1[n] % mod) % mod * (g2[d1+d2+d3+2] * g2[d1+d2+1] % mod) * g2[d1] % mod)**2 % mod * n_pow[d1+d2+d3] % mod
            res[n] %= mod

print(N)
print(*res[1:])