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 calc_small(N,K):
    n_pow = [pow(i,K,mod) for i in range(N+1)]

    res = [0] * (N+1)
    for a1 in range(1,N+1):
        for a2 in range(1,a1+1):
            for a3 in range(1,a2+1):
                n = a1 + a2 + a3
                if n > N:
                    continue

                res[n] += (((a1-a2+1) * (a1-a3+2) % mod) * ((a2-a3+1) % mod) % mod * (g2[a1+2] * g2[a2+1] % mod) * g2[a3] % mod)**2 % mod * n_pow[a1] % mod
    
    for n in range(N+1):
        res[n] *= g1[n] * g1[n]
        res[n] %= mod

    return res[1:]

def calc_mid(N,K):
    assert False

K = int(input())
N = 500
print(N)
print(*calc_small(N,K))