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

#ifdef _RUTHEN
#include "debug.hpp"
#else
#define show(...) true
#endif

using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> using V = vector<T>;

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N;
    cin >> N;
    V<mint> facl(N + 2);
    facl[0] = 1;
    for (int i = 1; i <= N + 1; i++) facl[i] = facl[i - 1] * i;
    show(facl);
    for (int k = 1; k <= N; k++) {
        mint ans = facl[N + 1] * k / (k + 1) * (N - k + 1);
        cout << ans.val() << '\n';
    }
    return 0;
}