#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int P = 998244353;
const int ng = 3;
const int ngi = (P + 1) / 3;

const int N = 1 << 21;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int inc(int a, int b) { return (a += b) >= P ? a - P : a; }
int dec(int a, int b) { return (a -= b) < 0 ? a + P : a; }
int mul(int a, int b) { return 1ll * a * b % P; }
int qpow(int a, int b) { int res = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) res = mul(res, a); return res; }

int fac[N], inv[N], finv[N];
void init(int w) {
  fac[0] = inv[1] = finv[0] = 1;
  rep(i, 1, w) fac[i] = mul(fac[i - 1], i);
  rep(i, 2, w) inv[i] = P - mul(P / i, inv[P % i]);
  rep(i, 1, w) finv[i] = mul(finv[i - 1], inv[i]);
}

int C(int a, int b) {
  if (a < b || b < 0) return 0;
  return mul(fac[a], mul(finv[b], finv[a - b]));
}

int rev[N];
void NTT(int *f, int lim, int opt) {
  rep(i, 0, lim - 1) if (i < rev[i]) swap(f[i], f[rev[i]]);
  for (int o = 2, k = 1; k < lim; o <<= 1, k <<= 1) {
    int d = qpow(opt == 1 ? ng : ngi, (P - 1) / o);
    for (int i = 0; i < lim; i += o) {
      for (int j = 0, g = 1; j < k; ++ j, g = mul(g, d)) {
        int u = f[i + j], v = mul(g, f[i + j + k]);
        f[i + j] = inc(u, v), f[i + j + k] = dec(u, v);
      }
    }
  }
  if (opt == -1) {
    int iv = qpow(lim, P - 2);
    rep(i, 0, lim - 1) f[i] = mul(f[i], iv);
  }
}

int n, f[N], g[N];

int main() {
  n = read(), init(n);
  rep(i, 0, n) {
    f[i] = qpow(i, n);
    g[i] = mul(i & 1 ? P - 1 : 1, mul(finv[i], finv[n - i]));
  }
  int lim = 1;
  while (lim <= n + n) lim <<= 1;
  rep(i, 0, lim - 1) rev[i] = ((rev[i >> 1] >> 1) | ((i & 1) * (lim >> 1)));
  NTT(f, lim, 1), NTT(g, lim, 1);
  rep(i, 0, lim - 1) f[i] = mul(f[i], g[i]);
  NTT(f, lim, -1);
  rep(i, 0, n - 1) printf("%d%c", dec(f[n - i], f[n - i - 1]), " \n"[i == n - 1]);
  return 0;
}