#include <algorithm> #include <bitset> #include <cassert> #include <cmath> #include <cstdio> #include <fstream> #include <functional> #include <iomanip> #include <iostream> #include <iterator> #include <map> #include <numeric> #include <queue> #include <set> #include <sstream> #include <stack> #include <unordered_set> using namespace std; #if __has_include(<atcoder/all>) #include <atcoder/all> using namespace atcoder; #endif #define GET_MACRO(_1, _2, _3, NAME, ...) NAME #define _rep(i, n) _rep2(i, 0, n) #define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++) #define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() using i64 = long long; template<class T, class U> bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; } template<class T, class U> bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; } template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;} template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);} template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;} template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;} template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;} using mint = modint998244353; vector<mint> fact(int x) { vector<mint> res(x + 1); res[0] = 1; rep(i, x) { res[i + 1] = res[i] * (i + 1); } return res; } vector<mint> finv(int x) { vector<mint> res(x + 1); mint t = 1; for(int i = 1; i <= x; i++) { t *= i; } res[x] = 1 / t; for(int i = x; i > 0; i--) { res[i - 1] = res[i] * i; } return res; } auto rrr = fact(200005); auto lll = finv(200005); mint comb(int x, int y) { if (x < 0 || y < 0 || x - y < 0) return 0; return rrr[x] * lll[y] * lll[x - y]; } mint perm(int x, int y) { if (x < 0 || x - y < 0) return 0; return rrr[x] * lll[x - y]; } int main(){ int n; cin >> n; vector dp(n + 1, vector<mint>(n, 0)); dp[0][0] = 1; for (int i = 0; i < n; i++){ for (int j = 0; j < i + 1; j++){ dp[i + 1][j] += dp[i][j]; for (int k = 2; k <= n - i; k++){ dp[i + k][j + k - 1] += dp[i][j] * comb(n - i - 1, k - 1) * pow_mod(k, k - 2, 998244353); } } } rep(i, n) cout << dp[n][i].val() << endl; }