import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		br.close();

		int n2 = n * 2;
		int mod = 998244353;
		Kaijou kai = new Kaijou(n2, mod);
		long[][] dp = new long[n2 + 1][n2 + 1];
		dp[1][1] = 1;
		for (int i = 1; i < dp.length; i++) {
			for (int j = 1; j < dp.length; j++) {
				if (i == 1 && j == 1) {
					continue;
				}
				if (i >= 3) {
					dp[i][j] += kai.comb(i - 1, 2) * dp[i - 2][j] % mod;
				}
				if (j >= 3) {
					dp[i][j] += kai.comb(j - 1, 2) * dp[i][j - 2] % mod;
				}
				if (i >= 2 && j >= 2) {
					dp[i][j] += (long) (i - 1) * (j - 1) * dp[i - 1][j - 1] % mod;
				}
				dp[i][j] += dp[i - 1][j - 1];
				dp[i][j] %= mod;
			}
		}
		PrintWriter pw = new PrintWriter(System.out);
		for (int i = 1; i <= n2 + 1; i++) {
			pw.println(dp[i - 1][n2 + 1 - i]);
		}
		pw.flush();
	}

	static class Kaijou {
		long[] p, pi;
		int m;

		public Kaijou(int n, int mod) {
			n++;
			m = mod;
			p = new long[n];
			pi = new long[n];
			p[0] = 1;
			pi[0] = 1;
			for (int i = 1; i < n; i++) {
				p[i] = p[i - 1] * i % m;
			}
			pi[n - 1] = BigInteger.valueOf(p[n - 1])
					.modInverse(BigInteger.valueOf(m)).longValue();
			for (int i = n - 1; i > 1; i--) {
				pi[i - 1] = pi[i] * i % m;
			}
		}

		public long comb(int n, int r) {
			if (n < r) return 0;
			return p[n] * pi[r] % m * pi[n - r] % m;
		}

		public long perm(int n, int r) {
			if (n < r) return 0;
			return p[n] * pi[n - r] % m;
		}
	}
}