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


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

const int mx = 1<<17;
mint fac[mx+1],ifac[mx+1];
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    fac[0] = 1;
    for(int i = 1;i<=mx;i++) fac[i] = fac[i-1] * i;
    for(int i = 0;i<=mx;i++) ifac[i] = fac[i].inv();

    int n;
    cin>>n;
    int m = 2 * n + 1;
    vector<vector<mint>> dp(m+1,vector<mint>(m+1,0));
    dp[0][0] = 1;
    for(int i = 0;i<m;i++){
        for(int j = 0;j<m;j++){
            mint tmp = i * j;
            dp[i+1][j+1] += tmp * dp[i][j];
            tmp = i * (i+1) / 2;
            if(i+2<=m) dp[i+2][j] += tmp * dp[i][j];
            tmp = j * (j+1) / 2;
            if(j+2<=m) dp[i][j+2] += tmp * dp[i][j];
            dp[i+1][j+1] += dp[i][j];
        }
    }
    for(int i = 0;i<=m-1;i++){
        cout<<dp[i][m-i-1].val()<<endl;
    }

}