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

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

// 階乗と逆元の前計算 https://drken1215.hatenablog.com/entry/2018/06/08/210000
class mintcombination
{
public:
  vector<mint> fac, finv, inv;

  mintcombination(int n)
  {
    fac.resize(n + 1);
    finv.resize(n + 1);
    inv.resize(n + 1);

    fac.at(0) = 1, finv.at(0) = 1;
    fac.at(1) = 1, finv.at(1) = 1, inv.at(1) = 1;

    for (int i = 2; i <= n; i++)
    {
      fac.at(i) = fac.at(i - 1) * i;
      inv.at(i) = mint::mod() - inv.at(mint::mod() % i) * (mint::mod() / i);
      finv.at(i) = finv.at(i - 1) * inv.at(i);
    }
  }
};

int main()
{
  int N;
  cin >> N;

  mintcombination com(N + 1);

  for (int K = 1; K <= N; K++)
  {
    mint ans = (mint)K * (mint)(N - K + 1) * com.fac.at(N + 1) * com.inv.at(K + 1);
    cout << ans.val() << endl;
  }
}