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

#define sz(x) (int)x.size();
#define all(x) x.begin(), x.end();

const int N = 1e6 + 200;
const int mod = 998244353;

int n, f[N], dp[N];

void solve() {
    cin >> n;
    f[0] = 1;
    f[1] = 1;
    for (int i = 2; i <= n; ++i) {
        f[i] = f[i - 1];
        if (i % 2 == 0) {
            f[i] += f[i / 2];
            f[i] %= mod;
        }
    }
    dp[1] = 1;
    dp[3] = 1;
    for (int i = 7; i <= n; i = i * 2 + 1) {
        dp[i] = f[i];
        for (int j = 1; j < i; j = j * 2 + 1) {
            int k = i - j;
            while (k % 2 == 0) k /= 2;
            dp[i] = (dp[i] - (f[j] * 1ll * dp[k] % mod) + mod) % mod;
        }
    }
    for (int i = 1; i <= n; ++i) {
        /* if (i != 2) continue; */
        int l = 0;
        int j = i, p = 1;
        while (true) {
            if (__builtin_popcount(j + 1) == 1) {
                break;
            }
            if (j & 1) {
                l += p;
            }
            j /= 2;
            p *= 2;
        }
        int r = i - l;
        while (r % 2 == 0) r /= 2;
        if (r == i) {
            cout << f[r] << " ";
            continue;
        }
        int cnt = 0;
        int pw = -1;
        while (r >= 1) {
            cnt += dp[r] * 1ll * f[l] % mod;
            cnt %= mod;
            /* cout << l << " " << r << '\n'; */
            r /= 2;
            l += p;
            pw = p;
            p *= 2;
        }
        cout << cnt << " ";
    }
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int T = 1;
    /* cin >> T; */
    while (T--) solve();
}