#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N;
  cin >> N;
  vector<vector<long long>> dp(N + 1);
  for (int i = 0; i <= N; i++){
    dp[i] = vector<long long>(i * 2 + 1, 0);
  }
  dp[0][0] = 1;
  for (int i = 1; i <= N; i++){
    for (int j = 1; j < i * 2; j++){
      dp[i][j] = dp[i - 1][j - 1];
      if (j >= 3){
        dp[i][j] += dp[i - 1][j - 2] * (j - 1) * (j - 2) / 2;
        dp[i][j] %= MOD;
      }
      dp[i][j] += dp[i - 1][j - 1] * (j - 1) * (i * 2 - 1 - j);
      dp[i][j] %= MOD;
      if (j < i * 2 - 2){
        dp[i][j] += dp[i - 1][j] * (i * 2 - 1 - j) * (i * 2 - 2 - j) / 2;
        dp[i][j] %= MOD;
      }
    }
  }
  for (int i = 0; i <= N * 2; i++){
    cout << dp[N][i] << endl;
  }
}