#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 ll;
const int N=1e6+10,mod=998244353;
int n,f[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;
		}
	}
	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{
			// debug(i);
			int len=__lg((1<<k+1)-1-i);
			// debug(len);
			ans[i]=f[len+1][i];
			for(int j=0;j<=len&&(1<<j)<=i-(1<<k);j++){
				// debug(j,f[j][i-(1<<k)-(1<<j)]);
				(ans[i]+=f[j][i-(1<<k)-(1<<j)])%=mod;
			}
		}
	}
	for(int i=1;i<=n;i++)printf("%d%c",ans[i],"\n "[i<n]);
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif