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

long long mod = 998244353;
long long nC2(long long n){
    return n*(n-1)/2%mod;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N; cin >> N;
    vector<vector<long long>> dp(2*N+1,vector<long long>(2*N+1));
    dp.at(0).at(0) = 1;
    for(int i=0; i<2*N; i+=2){
        for(int k=0; k<=2*N; k++){
            long long d = dp.at(i).at(k);
            if(d == 0) continue;
            
            long long l = k,r = i-k;
            dp.at(i+2).at(k+1) = (dp.at(i+2).at(k+1)+d)%mod;

            long long now = 0;
            now = nC2(l-1+2);
            dp.at(i+2).at(l+2) = (dp.at(i+2).at(l+2)+now*d)%mod;
            now = nC2(r-1+2);
            dp.at(i+2).at(l) = (dp.at(i+2).at(l)+now*d)%mod;
            dp.at(i+2).at(k+1) = (dp.at(i+2).at(k+1)+d*l*r)%mod;
        }
    }

    for(auto ans : dp.at(2*N)) cout << ans << endl;
}