#include <bits/stdc++.h> 
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
 #define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)

ll INF=2e18;

const int mod = 998244353;
class mint {
    long long x;
public:
    mint(long long x=0) : x((x%mod+mod)%mod) {}
    mint operator-() const { 
      return mint(-x);
    }
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator*=(const  mint& a) {
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    // for prime mod
    mint inv() const {
        return pow(mod-2);
    }
    mint& operator/=(const mint& a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }

    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
};




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)) return 0;
     if ((n < 0 || k < 0)) return 0;
    return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD;
}

long long nPk(int n, int k) {
    if((n < k)) return 0;
     if ((n < 0 || k < 0)) return 0;
    return fact[n] * fact_inv[n - k] % MOD;
}



int main() {
    ios::sync_with_stdio(false);
  cin.tie(0);
  
  ll N;cin>>N;
init_nCk(2*N+100);
vector<vector<mint>> dp(2*N+10,vector<mint> (2*N+10));
dp[1][1]=1;
dp[3][2]=1;

for(ll i=5;i<=2*N+1;i++) {
  for(ll j=2;j<i;j++) {
    if(j==2) {
      dp[i][j]+=dp[i-2][j]*nCk(i-3,2);
    }
    else if(j==i-1) {
      dp[i][j]+=dp[i-2][j-2]*nCk(i-3,2);
    }

    else {
      dp[i][j]+=dp[i-2][j-1];
      if(j-2>=2) dp[i][j]+=dp[i-2][j-2]*nCk(j-2,2);
      if(i-j-1>=2) dp[i][j]+=dp[i-2][j]*nCk(i-j-1,2);
      dp[i][j]+=dp[i-2][j-1]*(j-2)*(i-j-1);
    }
  }
}

for(ll i=1;i<=2*N+1;i++) {
  cout<<dp[2*N+1][i]<<endl;
}




}