#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5, P = 998244353;

int f[N], g[N], h[N];

signed main() {
    int n; scanf("%d", &n);
    g[0] = 1;
    for (int i = 1; i <= n; ++i) {
        if (i & 1) g[i] = g[i - 1];
        else ((g[i] = g[i - 1] + g[i >> 1]) >= P) && (g[i] -= P);
    }
    for (int i = 1; i <= 19; ++i) {
        h[i] = g[(1 << i) - 1];
        for (int j = 1; j < i; ++j) h[i] = (h[i] + 1ll * (P - h[j]) * g[(1 << (i - j)) - 1]) % P;
    }
    for (int i = 1, k = 0; i <= n; ++i) {
        while ((1 << (k + 1)) <= i) ++k;
        for (int j = k; ~j && ((i >> j) & 1); --j) {
            f[i] = (f[i] + 1ll * g[i & ((1 << j) - 1)] * h[k - j + 1]) % P;
        }
        printf("%d%c", f[i], " \n"[i == n]);
    }
    return 0;
}