def cmb(n, r,): if ( r<0 or r>n ): return 0 r = min(r, n-r) return g1[n] * g2[r] * g2[n-r] % mod mod = 998244353 #出力の制限 N = 10**5 g1 = [1, 1] # 元テーブル g2 = [1, 1] #逆元テーブル inverse = [0, 1] #逆元テーブル計算用テーブル for i in range( 2, N + 1 ): g1.append( ( g1[-1] * i ) % mod ) inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod ) g2.append( (g2[-1] * inverse[-1]) % mod ) K=int(input()) L=[0]*(2*K+1) mod=998244353 ans=1 kaijyo=1 for i in range(1,2*K+1): kaijyo*=i kaijyo%=mod ans*=pow(2,2*K-1,mod) B=list() B.append(1) for i in range(1,2*K+1): if i%2==1 and i>1: B.append(0) continue a=0 for j in range(i): a+=cmb(i+1,j)*B[j] a%=mod a*=pow(i+1,-1,mod)*-1 a%=mod B.append(a) ans*=pow(kaijyo,-1,mod) ans%=mod if K%2==0: ans*=-1 L[-1]=ans*B[-1]%mod print(*L)