#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000005
#define Inf64 4000000000000000001LL

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};

combi C(1000000);
int main(){
	
	int n;
	cin>>n;
	
	vector<mint> dp(n+1);
	dp[n] = 1;
	vector<mint> E(n+1);
	for(int i=n;i>=2;i--){
		mint Gyaku = (mint(2).pow(i) - 2).inv();
		for(int j=1;j<=i-1;j++){
			dp[i-j] += dp[i] * C.combination(i,j) * Gyaku;
		}
		E[i] = (mint(2).pow(i) - 2) * 3;
		E[i] /= mint(3).pow(i);
		E[i] = E[i].inv();
	}
	
	for(int i=1;i<=n;i++){
		mint ans = 0;
		for(int j=i+1;j<=n;j++)ans += E[j] * dp[j];
		if(i!=1)cout<<' ';
		cout<<ans.val();
	}
	cout<<endl;
			
	return 0;
}