#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<tuple>

#define fi first
#define se second
#define mkp std::make_pair
using llu=long long unsigned;
using ll=long long;
using std::max;
using std::min;
template<class T> void cmax(T&a,T b){a=max(a,b);}
template<class T> void cmin(T&a,T b){a=min(a,b);}

const ll mod=998244353;
const int NV=1e6;

namespace xm{
    int f[NV+5],g[NV+5];
    void _(){
        int N;

        scanf("%d",&N);

        f[0]=1;
        for(int k=1;k<=N;k<<=1)
        for(int i=k;i<=N;++i) f[i]=(f[i]+f[i-k])%mod;
        for(int i=1;i<20;++i){
            g[i]=f[(1<<i)-1];
            for(int j=1;j<i;++j) g[i]=(g[i]-(ll)g[j]*f[(1<<i-j)-1])%mod;
        }
        for(int i=1;i<=N;++i) {
            ll ans=0;
            int k=std::__lg(i);
            for(int j=k;~j;--j)
                if(i>>j&1){
                    ans=(ans+(ll)g[k-j+1]*f[i&(1<<j)-1])%mod;
                }else break;
            printf("%lld ",(ans+mod)%mod);
        }
        puts("");
    }
}

int main(){
    xm::_();
    return 0;
}