#include<bits/stdc++.h>
using namespace std;

void solve(){
    int N;
    cin >> N;
    const int MOD = 998244353;
    vector<vector<int>> knap(22, vector<int>(1000100));
    vector<vector<int>> knap2(22, vector<int>(1000100));
    knap[21][0] = 1;
    for(int i = 20; i >= 0; i --){
        knap[i] = knap[i + 1];
        int t = 1 << i;
        for(int j = t; j <= 1000000; j ++){
            knap[i][j] = (knap[i][j] + knap[i][j - t]) %MOD;
        }
    }
    knap2[0][0] = 1;
    for(int i = 0; i <= 20; i ++){
        if(i)
        knap2[i] = knap2[i - 1];
        int t = 1 << i;
        for(int j = t; j <= 1000000; j ++){
            knap2[i][j] = (knap2[i][j]+ knap2[i][j - t]) %MOD;
        }
    }

    for(int i = 1; i <= N; i ++){
        int t = (1 << (31 - __builtin_clz(i)));
        int next = t * 2;
        int gap = (31 - __builtin_clz((next - i) * 2) - 1);
        int left = max(i - t, 1);
        cout << (knap[gap][i] + (gap && i - t? knap2[gap - 1][i - t]:0)) % MOD << " ";
    }
    cout << endl;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int N = 1;
    //cin >> N;
    while(N --){
        solve();
    }
    return 0;
}