#include <bits/stdc++.h>
using namespace std;
const int N = 5001, mod = 998244353;
long long n, dp[N][N];
long long inv(long long a) {
  int k = mod - 2;
  long long b = 1;
  while (k) {
    if (k % 2) b = b * a % mod;
    a = a * a % mod;
    k /= 2;
  }
  return b;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  dp[0][0] = 1;
  for (int i = 2; i <= n; i++) dp[0][0] = dp[0][0] * i % mod;
  for (int i = 1; i <= n; i++) {
    long long invi = inv(i);
    for (int j = 1; j <= i; j++) {
      dp[i][j] = ((i - j + 1) * dp[i - 1][j - 1] + j * dp[i - 1][j]) % mod *
                 invi % mod;
    }
  }
  for (int j = 1; j <= n; j++) {
    int ans = 0;
    for (int i = j; i <= n; i++) {
      ans += dp[i][j];
      if (ans >= mod) ans -= mod;
    }
    cout << ans << " ";
  }
  cout << "\n";
  return 0;
}
