#include<bits/stdc++.h>

#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array
#define eb emplace_back
#define IL inline

using namespace std;

#define N 1000005
#define mod 998244353

IL int pls(int x,int y){return (x+y>=mod?x+y-mod:x+y);}
IL int sub(int x,int y){return (x-y<0?x-y+mod:x-y);}
IL void Add(int &x,int y){x=pls(x,y);}
IL void Dec(int &x,int y){x=sub(x,y);}
IL int mul(int x,int y){return x*1ll*y%mod;}

int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(int x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

int f[N],g[N];

int hb(int x){return (x==0?-1:__lg(x));}

int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    #endif

    int n=read();
    f[0]=1;g[0]=1;
    for(int k=1;k<=n;k<<=1)for(int i=1;i<=n;i++)if(i>=k)Add(f[i],f[i-k]);
    for(int i=1;i<=n;i++){
        for(int k=1;k<=n;k<<=1){
            if(i<2*k)continue;
            if((i-2*k)%k!=0)continue;
            Add(g[i],mul(f[k],g[(i-2*k)/k]));
        }
    }
    for(int i=1;i<=n;i++){
        int ans=0;
        for(int k=0;(1<<k)<=i;k++){
            int rem=(1<<k)-(i%(1<<k));
            if(hb(i-rem)==hb(i+rem))continue;
            Add(ans,mul(f[i%(1<<k)],g[i/(1<<k)-1]));
        }
        write(ans);putchar(' ');
    }
}