#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 10;
const int P = 998244353;
int s2[N][N];
int c[N][N];
int fact[N];
inline void add(int &x, int y) {
  x += y;
  if (x >= P) x -= P;
}
inline void init() {
  c[0][0] = s2[0][0] = fact[0] = 1;
  for (int i = 1; i <= N - 1; ++i)
    c[i][0] = 1, s2[i][0] = 0, fact[i] = 1LL * fact[i - 1] * i % P;
  for (int i = 1; i <= N - 1; ++i)
    for (int j = 1; j <= i; ++j) {
      add(c[i][j] = c[i - 1][j], c[i - 1][j - 1]);
      add(s2[i][j] = 1LL * j * s2[i - 1][j] % P, s2[i - 1][j - 1]);
    }
}
int n, ans[N], res[N];
int main() {
  init();
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    for (int j = i - 1; j >= 0; --j) {
      add(res[j],
          1LL * c[n][i] * s2[i][i - j] % P * fact[i - j] % P * fact[n - i] % P);
    }
  }
  for (int j = n - 1; j >= 0; --j) {
    for (int w = n - 1; w >= j + 1; --w)
      add(res[j], P - 1LL * c[w][w - j] * res[w] % P);
    add(ans[j + 1], res[j]);
  }
  for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
  return 0;
}
