Problem: Note that the only differences between easy and hard versions are the constraints on n and the time limit. You can make hacks only if all versions are solved.

Slime is interested in sequences. He defined good positive integer sequences p of length n as follows:

  * For each k>1 that presents in p, there should be at least one pair of indices i,j, such that 1 ≤ i < j ≤ n, p_i = k - 1 and p_j = k.



For the given integer n, the set of all good sequences of length n is s_n. For the fixed integer k and the sequence p, let f_p(k) be the number of times that k appears in p. For each k from 1 to n, Slime wants to know the following value:

$$$\left(∑_{p∈ s_n} f_p(k)\right)\ mod\ 998 244 353$$$

Input

The first line contains one integer n\ (1≤ n≤ 5000).

Output

Print n integers, the i-th of them should be equal to \left(∑_{p∈ s_n} f_p(i)\right)\ mod\ 998 244 353.

Examples

Input


2


Output


3 1 


Input


3


Output


10 7 1 


Input


1


Output


1 

Note

In the first example, s=\{[1,1],[1,2]\}.

In the second example, s=\{[1,1,1],[1,1,2],[1,2,1],[1,2,2],[2,1,2],[1,2,3]\}.

In the third example, s=\{[1]\}.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 5005;
const int MOD = 998244353;
int n, d[MAXN][MAXN], dp[MAXN][MAXN], val[MAXN], fact[MAXN], inv[MAXN];
int quick(int A, int B) {
  if (B == 0) return 1;
  int tmp = quick(A, B >> 1);
  tmp = 1ll * tmp * tmp % MOD;
  if (B & 1) tmp = 1ll * tmp * A % MOD;
  return tmp;
}
int main() {
  cin >> n;
  d[0][0] = 1;
  fact[0] = 1;
  for (int i = 1; i <= n; ++i) fact[i] = 1ll * fact[i - 1] * i % MOD;
  inv[n] = quick(fact[n], MOD - 2);
  for (int i = n - 1; i >= 0; --i) inv[i] = 1ll * inv[i + 1] * (i + 1) % MOD;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      d[i][j] = (1ll * d[i - 1][j] * j % MOD +
                 1ll * d[i - 1][j - 1] * (i - j + 1) % MOD) %
                MOD;
  for (int i = 0; i <= n - 1; ++i) {
    for (int x = i; x <= n - 1; ++x) {
      val[i] += 1ll * d[x][i] * inv[x + 1] % MOD;
      val[i] %= MOD;
    }
  }
  for (int i = 1; i <= n; ++i) {
    int ans = 0;
    for (int j = 1; j <= n; ++j) {
      ans += 1ll * d[j][i] * inv[j] % MOD;
      ans %= MOD;
    }
    ans = 1ll * ans * fact[n] % MOD;
    printf("%d ", ans);
  }
  return 0;
}