#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001
struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};


combi C(3000000);
int main(){
	
	int n;
	cin>>n;
	vector<mint> dp(1,1);
	rep(i,n){
		vector<mint> ndp(dp.size()+2,0);
		rep(j,dp.size()){
			int x = j;
			int y = i*2 + 1 - x - 1;
			ndp[j+1] += dp[j];
			ndp[j+1] += dp[j] * x * y;
			if(y!=0)ndp[j] += dp[j] * C.junretsu(y-1,2);
			if(x!=0)ndp[j+2] += dp[j] * C.junretsu(x-1,2);
		}
		swap(dp,ndp);
	}
	rep(i,dp.size()){
		cout<<dp[i].val()<<endl;
	}
	
	return 0;
}