#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll const m = 998244353;
int main () {
	int N;
	cin >> N;
	ll dp[4020][4020];
	ll cb[4020][4020];
	for (int n = 0; n <= N * 2 + 1; n ++) {
		cb[n][0] = cb[n][n] = 1;
		for (int r = 1; r < n; r ++) {
			cb[n][r] = (cb[n - 1][r] + cb[n - 1][r - 1]) % m;
		}
	}
	auto comb = [&](int n, int r) -> ll {
		if (r < 0 || n < r) return 0;
		return cb[n][r];
	};
	for (int l = 0; l <= N * 2; l ++) {
		for (int r = 0; r <= N * 2; r ++) {
			if (l + r == 0) {
				dp[l][r] = 1;
			} else if (l * r == 0) {
				dp[l][r] = 0;
			} else {
				dp[l][r] = (1ll + (l - 1) * (r - 1)) * dp[l - 1][r - 1];
				dp[l][r] %= m;
				if (l > 2) {
					dp[l][r] += comb(l - 1, 2) * dp[l - 2][r];
					dp[l][r] %= m;
				}
				if (r > 2) {
					dp[l][r] += comb(r - 1, 2) * dp[l][r - 2];
					dp[l][r] %= m;
				}
			}
		}
	}
	for (int i = 0; i < N * 2 + 1; i ++) {
		cout << dp[i][N * 2 - i] << endl;
	}
}