#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll mod=998244353;
const int maxn=2000000;
ll n;
ll f[maxn+50];
ll g[maxn+50];
ll h[maxn+50];
ll lg[maxn+50];

int main(){
	ios_base::sync_with_stdio(false);
	cin >> n;
	f[0]=1;
	lg[0]=-1;
	for (ll i=1;i<=n;i++){
		if (i%2==1) f[i]=f[i-1];
		else f[i]=(f[i-1]+f[i/2])%mod;
		lg[i]=lg[i/2]+1;	
	}
	
	h[1]=1;
	for (ll i=2;i<=lg[n];i++){
		ll now=(1<<i)-1;
		h[i]=f[now];
	//	cout << i << " " << now << endl;
		for (ll j=1;j<i;j++){
			now=now/2;
			h[i]=(h[i]+mod-h[j]*f[now]%mod)%mod;
		}
	}
//	for (int i=1;i<=lg[n];i++) cout << h[i] << " ";
//	cout << "\n";
	
	for (ll i=1;i<=n;i++){
//		if (i==(1LL<<(lg[i]+1))-1){
//			g[i]=f[i];
//			continue;
//		}
		ll now=i;
		for (ll j=lg[i];j>=0;j--){
			if (((i>>j)&1)==0) break;
			now-=1LL<<j;
			g[i]=(g[i]+h[lg[i]-j+1]*f[now])%mod;
		}
	}
	for (ll i=1;i<=n;i++) cout << g[i] << " \n"[i==n];
	
//	for (ll i=1;i<=n;i++) cout << setw(2) << f[i] << " \n"[i==n];
//	for (ll i=1;i<=n;i++) cout << setw(2) << g[i] << " \n"[i==n];
	
	return 0;
}