#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define pb push_back

typedef long long ll;
#define int ll

const int mod = 998244353;

const int N = 1e6+100;
const int K = 20;
signed all[N][K];
int ans[N][K];
int hb[N];

int f(int n, int k)
{
    if (n==1)
        return 1;
    int h = hb[n];
    k = min(k, h);
    if (ans[n][k] != -1)
        return ans[n][k];

    int A = 0;
    if (k >= h)
        A = all[n-(1<<h)][k];
    int r = n-(1<<h);
    if (hb[r] != h-1)
    {
        return ans[n][k] = A;
    }
    int l = (1<<(h+1)) - n;

    for (int y=hb[l]; y<=min(k, h-1); y++)
        if ((1<<y) >= l)
            for (int x=y; x<=min(k, h-1); x++)
            {
                int X = all[(1<<(h-1-x))-1][k-x];
                int Y = all[(1<<(h-1-y))-1][x-y];
                int Z = f(r, y);
                A = (A+X*Y%mod*Z%mod)%mod;
            }
    return ans[n][k] = A;
}

main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    for (int i=0; i<K; i++)
        ans[0][i] = 1;
    for (int i=1; i<N; i++)
        for (int j=0; j<K; j++)
        {
            if (j>=1)
                ans[i][j] = ans[i][j-1];
            if (i>=(1<<j))
                ans[i][j] = (ans[i][j] + ans[i-(1<<j)][j]) % mod;
        }
    for (int i=0; i<N; i++)
        for (int j=0; j<K; j++)
            all[i][j] = ans[i][j], ans[i][j] = -1;
    hb[0] = -1;
    for (int i=1; i<N; i++)
        hb[i] = hb[i/2]+1;

    int n;
    cin>>n;
    for (int i=1; i<=n; i++)
        cout<<f(i, K-1)<<" ";
    cout<<"\n";
}