#include <bits/stdc++.h>
using namespace std;
const int N = 5005, mod = 998244353;
int fac[N], ifac[N], E[N][N], n;
inline int power(int a, int b) {
  int k = b, y = a, t = 1;
  while (k) {
    if (k & 1) t = (1ll * t * y) % mod;
    y = (1ll * y * y) % mod;
    k >>= 1;
  }
  return t;
}
int main() {
  scanf("%d", &n);
  fac[0] = 1;
  for (int i = 1; i < N; ++i) fac[i] = (1ll * fac[i - 1] * i) % mod;
  ifac[N - 1] = power(fac[N - 1], mod - 2);
  for (int i = N - 2; ~i; --i) ifac[i] = (1ll * (i + 1) * ifac[i + 1]) % mod;
  memset(E, 0, sizeof E);
  E[0][0] = 1;
  for (int i = 1; i < N; ++i) {
    E[i][0] = 1;
    for (int j = 1; j <= i; ++j) {
      E[i][j] = (1ll * E[i][j] + 1ll * (j + 1) * E[i - 1][j]) % mod;
      E[i][j] = (1ll * E[i][j] + 1ll * (i - j) * E[i - 1][j - 1]) % mod;
    }
  }
  for (int i = 0; i < n; ++i) {
    int ans = 0;
    for (int j = i ? i : 1; j <= n; ++j) {
      ans += (1ll * ifac[j] * E[j][i]) % mod;
      ans %= mod;
    }
    ans = (1ll * ans * fac[n]) % mod;
    printf("%d ", ans);
  }
  return 0;
}
