#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using mint = atcoder::modint998244353;

int main() {
	int N;
	cin >> N;
	vector<vector<mint>> dp(2*N+1, vector<mint>(2*N+1));
	dp[1][1] = 1;
	for( long long s = 2; s <= 2*N-2; s+=2 ) {
		for( long long x = 1, y = s-1; x <= s-1; x++, y-- ) {
			dp[x+1][y+1] += dp[x][y]*(x*y+1);
			dp[x+2][y+0] += dp[x][y]*(x*(x+1)/2);
			dp[x+0][y+2] += dp[x][y]*(y*(y+1)/2);
		}
	}
	for( int k = 1; k <= 2*N+1; k++ ) {
		cout << dp[k-1][2*N-k+1].val() << endl;
	}
}