/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
const int INF=1e18;
int n;
int dp[1000005],f[2][2000005];
const int M=1000000;
void solve()
{
	dp[0]=1;
	for(int i=0;i<20;i++) for(int j=0;j+(1<<i)<=M;j++) dp[j+(1<<i)]=(dp[j+(1<<i)]+dp[j])%mod;
	cin>>n;
	cout<<"1 ";
	for(int k=1;k<20;k++)
	{
		memset(f,0,sizeof(f));
		int nw=0;
		f[nw][1]=1;
		for(int j=k-1;j>=0;j--)
		{
			nw^=1;
			memset(f[nw],0,sizeof(f[nw]));
			for(int x=1;x<=(1<<(k+1));x++) if(f[nw^1][x]) f[nw][2*x+1]=f[nw^1][x];
			for(int x=(1<<(k+1));x>=0;x--) f[nw][x]=(f[nw][x]+f[nw][x+1])%mod;
		}
		f[nw][0]=0;
		for(int j=(1<<k);j<(1<<(k+1));j++) if(j<=n) cout<<(dp[j]-f[nw][(1<<(k+1))-1-j]+mod)%mod<<" ";
	}
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}