#include <bits/stdc++.h>
const int CN = 5050, P = 998244353;
int n, fac[CN], ifac[CN], E[CN][CN];
int C(int n, int m) {
  return m < 0 || m > n ? 0 : (long long)fac[n] * ifac[m] % P * ifac[n - m] % P;
}
int main() {
  E[0][0] = 1;
  for (int i = 1; i <= 5000 && (E[i][0] = 1); i++)
    for (int j = 1; j <= i; j++)
      E[i][j] = ((long long)(j + 1) * E[i - 1][j] +
                 (long long)(i - j) * E[i - 1][j - 1]) %
                P;
  fac[0] = ifac[0] = ifac[1] = 1;
  for (int i = 1; i <= 5000; i++) fac[i] = (long long)fac[i - 1] * i % P;
  for (int i = 2; i <= 5000; i++)
    ifac[i] = (long long)ifac[P % i] * (P - P / i) % P;
  for (int i = 2; i <= 5000; i++)
    ifac[i] = (long long)ifac[i - 1] * ifac[i] % P;
  scanf("%d", &n);
  for (int i = 1, res = 0; i <= n; res = 0, i++) {
    for (int j = 1; j <= n; j++)
      res = (res + (long long)E[j][i - 1] * C(n, j) % P * fac[n - j]) % P;
    printf("%d ", res);
  }
  puts("");
  return 0;
}
