#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define all(a) (a).begin(),(a).end()
#ifdef DEBUG
template<class T>
ostream& operator << (ostream &out,vector<T> a){
	out<<'[';
	for(T x:a)out<<x<<',';
	return out<<']';
}
template<class T>
vector<T> ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<class T>
void debug(T x){
	cerr<<x<<endl;
}
template<class T,class...S>
void debug(T x,S...y){
	cerr<<x<<' ',debug(y...);
}
#else
#define debug(...) void()
#endif
const int N=1e6+10,mod=998244353;
int n,f[21][N],g[21][N],h[21][N],ans[N];
int main(){
	cin>>n;
	f[20][0]=1;
	for(int k=19;k>=0;k--){
		copy(f[k+1],f[k+1]+1+n,f[k]);
		for(int i=(1<<k);i<=n;i++){
			(f[k][i]+=f[k][i-(1<<k)])%=mod;
		}
	}
	g[20][0]=1;
	for(int k=19;k>=0;k--){
		copy(g[k+1],g[k+1]+1+n,g[k]);
		for(int i=0;i<=n;i++){
			if(i>=(1<<k+1))(g[k][i]+=g[k][i-(1<<k+1)])%=mod;
			for(int j=k+1;j<=19&&i>=(1<<j+1);j++){
				g[k][i]=(g[k][i]+1ll*g[j][i-(1<<j+1)]*(f[k][1<<j]-f[k+1][1<<j]+mod))%mod;
			}
		}
	}
	fill(h[0],h[0]+1+n,1);
	for(int k=1;k<=19;k++){
		copy(h[k-1],h[k-1]+1+n,h[k]);
		for(int i=(1<<k);i<=n;i++){
			(h[k][i]+=h[k][i-(1<<k)])%=mod;
		}
	}
	for(int i=1;i<=n;i++){
		int k=__lg(i);
		if(i==(1<<k+1)-1){
			ans[i]=f[0][i];
		}else if(i<(1<<k)+(1<<k-1)){
			ans[i]=f[0][i-(1<<k)];
		}else{
			int sum=(1<<k+1)-i;
			for(int j=__lg(sum-1)+1;(1<<j)<=i;j++){
				ans[i]=(ans[i]+1ll*h[j][(i-(1<<j))%(1<<j+1)]*g[j][(i-(1<<j))>>j+1<<j+1])%mod;
			}
		}
	}
	for(int i=1;i<=n;i++)printf("%d%c",ans[i],"\n "[i<n]);
	return 0;
}