#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 998244353;
vector<long long> fact, fact_inv, inv;
void init_nCk(int SIZE) {
    fact.resize(SIZE + 5);
    fact_inv.resize(SIZE + 5);
    inv.resize(SIZE + 5);
    fact[0] = fact[1] = 1;
    fact_inv[0] = fact_inv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < SIZE + 5; i++) {
        fact[i] = fact[i - 1] * i % mod;
        inv[i] = mod - inv[mod % i] * (mod / i) % mod;
        fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;
    }
}
long long nCk(int n, int k) {
    if(n < k || n < 0 || k < 0) return 0;
    return fact[n] * (fact_inv[k] * fact_inv[n - k] % mod) % mod;
}
int m[4500][4500];
int f(int a, int b){
	if(a == 0 && b == 0){
		return 1;
	} 
	if(a < 0 || b < 0) return 0;
	if(m[a][b] != -1) return m[a][b];
	m[a][b] = (f(a-2,b)*nCk(a-1,2)+f(a,b-2)*nCk(b-1,2))%mod;
	if(a && b) m[a][b] = (m[a][b]+(f(a-1,b-1)%mod*((a*b-a-b+2)%mod))%mod)%mod;
	return m[a][b];
}
signed main(){
	init_nCk(100000);
	for(int i=0;i<4500;i++)for(int j=0;j<4500;j++) m[i][j] = -1;
	int N;
	cin>>N;
	for(int z=0;z<2*N+1;z++){
		int a = z, b = 2*N-z;
		cout<<f(a,b)<<endl;
	}
	/*for(int i=0;i<=2*N;i++){
		for(int j=0;j<=2*N;j++) cout<<m[i][j]<<' ';
		cout<<endl;
	}*/
}