// Problem: # 8834. Formal Fring
// Author: XZC(L_Wave)
// Language: Cpp/G++20
// Contest: 
// URL: https://qoj.ac/problem/8834
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// Create Time: not 2024-11-20 09:52:28, but 1926-08-17 11:45:14
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a), i##ABRACADABRA = (b); i <= i##ABRACADABRA; i++)
#define drep(i, a, b) for (int i = (a), i##ABRACADABRA = (b); i >= i##ABRACADABRA; i--)
using namespace std;
using ll = long long;
constexpr ll mod=998244353;

ll all[1<<20|5],dp[25],hb[1<<20|5];
int n;

int main() {
  scanf("%d",&n);
  hb[0]=-1,hb[1]=0;
  all[0]=1;
  rep(i,2,n)hb[i]=hb[i>>1]+1;
  for (int i=1;i<=n;i<<=1)rep(S,i,n)(all[S]+=all[S-i])%=mod;
  // rep(i,0,n)cout<<all[i]<<'\n';
  rep(i,1,19){
    dp[i]=all[(1<<i)-1];
    drep(j,i-1,1)(dp[i]+=(mod-dp[j])*all[(1<<(i-j))-1])%=mod;
    // cout<<i<<' '<<dp[i]<<'\n';
  }
  rep(S,1,n){
    ll res=0;
    // cout<<S<<' '<<hb[S]<<'\n';
    drep(i,hb[S],0){
      if ((~S)>>i&1)break;
      (res+=dp[hb[S]-i+1]*all[S&((1<<i)-1)])%=mod;
    }
    printf("%lld ",res);
  }
  return 0;
}