#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned long long;
const int N=1e6+10,mod=998244353;
int n,f[N],g[N],h[N];
int main(){
	scanf("%d",&n);
	f[1]=1;
	for(int k=0;(1<<k)<n;k++){
		for(int i=1<<k;i<=n;i++)(f[i]+=f[i-(1<<k)])%=mod;
	}
	g[0]=1;
	for(int i=1;i<=n;i++){
		if(i%2==0)(g[i]+=g[i/2])%=mod;
		for(int k=0;(1<<k+1)<=i&&i%(1<<k)==0;k++){
			g[i]=(g[i]+1ll*g[i-(1<<k+1)>>k]*f[1<<k])%mod;
		}
	}
	h[0]=1;
	for(int k=0;(1<<k)<n;k++){
		for(int i=1<<k;i<=n;i++)(h[i]+=h[i-(1<<k)])%=mod;
	}
	debug(ary(f,1,n));
	debug(ary(g,1,n));
	for(int i=1;i<=n;i++){
		int ans=0;
		for(int k=0;(1<<k)<=i;k++){
			int x=i%(1<<k),y=i-x-(1<<k),z=(1<<k)-x;
			if(__lg(i+z)==__lg(i-z))continue;
			ans=(ans+1ll*g[y>>k]*h[x])%mod;
		}
		printf("%d%c",ans,"\n "[i<n]);
	}
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif