// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define TEST cerr << "TEST" << endl
#define AMARI 998244353
// #define AMARI 1000000007
#define TIME_LIMIT 1980000
#define el '\n'
#define El '\n'

#define MULTI_TEST_CASE false
void solve(void) {
    int n;
    cin >> n;
    //dp[i][j] := ある値について、左からi個、右からj個取るのが何通りあるか
    vector<vector<ll>> dp(2 * n + 1,vector<ll>(2 * n + 1));
    dp[0][0] = 1;
    for(int i = 0; i < 2 * n + 1; i++){
        for(int j = 0; j < 2 * n + 1; j++){
            if(i == 0 && j == 0)continue;
            if(i >= 1 && j >= 1){
                //外側(1) + 内側((i-1)*(j-1))
                dp[i][j] += dp[i - 1][j - 1] *(ll)((i - 1) * (j - 1) + 1);
                dp[i][j] %= AMARI;
            }
            if(i >= 2){
                dp[i][j] += dp[i - 2][j] * (ll)((i - 2) * (i - 1) / 2);
                dp[i][j] %= AMARI;
            }
            if(j >= 2){
                dp[i][j] += dp[i][j - 2] * (ll)((j - 2) * (j - 1) / 2);
                dp[i][j] %= AMARI;
            }
        }
    }
    for(int i = 0; i < 2 * n + 1; i++){
        //cerr << i << ' ' << 2 * n - i << el;
        cout << dp[i][2 * n - i] << el;
    }
    return;
}

void calc(void) {
    return;
}

//WTFday1A
//ABC227D
//ABC325G
//ABC191F
//ARC110C

signed main(void) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    calc();
    int t = 1;
    if(MULTI_TEST_CASE) cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}