#include<bits/stdc++.h>
using namespace std;
#define V vector
#define pb push_back


typedef long long LL;
typedef pair<int, int> pi;

const int mod = 998244353;

void solve() {
    int n; cin >> n;
    const int to = 1e6;
    V<V<int>> f(to + 1, V<int>(22));
    for(auto &y : f[0]) y = 1;
    for(int i = 1; i <= to; i++) {
        for(int j = 0; j < 22; j++) {
            if(j) f[i][j] += f[i][j - 1];
            if(f[i][j] >= mod) f[i][j] -= mod;
            if(i - (1 << j) >= 0) f[i][j] += f[i - (1 << j)][j];
            if(f[i][j] >= mod) f[i][j] -= mod;

        }
    }

    V<V<int>> dp(20);
    for(int i = 1; i <= 19; i++) {
        dp[i].resize(i + 1);
        for(int bit = 0; bit < 1 << i; bit++) {
            int t = 1;
            int lst = 0;
            LL cur = 1;
            for(int j = 0; j < i; j++) {
                if(bit >> j & 1) {
                    // t *= -1;
                    cur *= -1;
                    cur = cur * f[(1 << j - lst + 1) - 1][21] % mod;
                    lst = j + 1;
                }
            }
            dp[i][i - lst] += cur;
            if(dp[i][i - lst] >= mod) dp[i][i - lst] -= mod;
            if(dp[i][i - lst] < 0) dp[i][i - lst] += mod;
        }
    }

    // for(int i = 1; i <= 10; i++) {
    //     for(int j = 0; j <= i; j++) {
    //         cout << dp[i][j] << " \n"[j == i];
    //     }
    // }


    // for(int i = 1; i <= n; i++) cout << dp[i][22]
    for(int i = 1; i <= n; i++) {
        int hi = __lg(i);
        int lo = hi;
        while(lo && (i >> lo - 1 & 1)) lo--;
        int cnt = hi - lo + 1;
        //dp[cnt];
        LL cur = i;
        LL ans = 0;
        for(int i = hi; i >= lo - 1; i--) {
            ans += 1LL * dp[cnt][i - lo + 1] * f[cur][21] % mod;
            if(ans >= mod) ans -= mod;

            //end
            if(i != lo - 1) cur -= 1 << i;
        }
        LL to_say = f[i][21] - ans;
        if(to_say < 0) to_say += mod;
        cout << to_say << " ";
    }

    
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    // int t; cin >> t;
    // while(t--) solve();
    solve();
}