#include <iostream>
#include <atcoder/modint>

using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
const int MX = 1000010;
mint f[MX],inv[MX],fi[MX];
constexpr ll mod = 998244353;
void solve(){
    inv[1] = 1;
    for(int i=2;i<MX;i++){
        inv[i] = mod - (mod/i)*inv[mod%i];
    }
    f[0] = fi[0] = 1;
    for(int i=1;i<MX;i++){
        f[i] = f[i-1]*i;
        fi[i] = fi[i-1]*inv[i];
    }
}

mint nck(ll n, ll k){
    if(n<0 || k<0 || n<k) return 0;
    return f[n]*fi[k]*fi[n-k];
}

mint pw(mint a,ll x){
    mint ret = 1;
    while(x){
        if(x&1) (ret *= a);
        (a *= a); x /= 2;
    }
    return ret;
}

mint p[5010],iv[5010],dp[5010];
int main(){
    solve();
    int i,j,r; cin >> r;
    p[0] = 1;
    for(i=1;i<=r;i++) p[i] = p[i - 1]*3;
    for(i=2;i<=r;i++) iv[i] = (mint)1/(mint)(pw(2,i) - 2);
    dp[r] = 1;
    for(i=r - 1;i>=1;i--){
        for(j=i + 1;j<=r;j++){
            dp[i] += nck(j,i)*iv[j]*dp[j];
        }
    }
    for(i=1;i<=r;i++){
        mint ans = 0;
        for(j=i + 1;j<=r;j++){
            ans += dp[j]*p[j - 1]*iv[j];
        }
        cout << ans.val() << " ";
    }
    cout << "\n";
}