#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
typedef long long ll;
constexpr int N = 1e6;
constexpr ll mod = 998244353;
int n;
ll f[N + 3], g[N + 3], sg[N + 3];
inline int lowbit(int x) {return x & -x;}
int main() {
    scanf("%d", &n);
    g[0] = sg[0] = 1;
    for(int i = 1; i <= n; i++) {
        g[i] = sg[i >> 1];
        sg[i] = (sg[i - 1] + g[i]) % mod;
    }
    f[0] = f[1] = 1;
    for(int x = 2, hb = 0; x <= n; x++) {
        if(x + 1 == lowbit(x + 1)) {
            f[x] = g[x]; continue;
        }
        if(x == lowbit(x)) ++hb;
        int tmp = 0, y = x ^ (1 << hb);
        f[x] = g[y];
        for(int i = hb - 1; i >= 0; i--) {
            if((x >> i & 1) == 0) break;
            y ^= 1 << i;
            ++tmp;
            ll dt = (g[(1 << (tmp + 1)) - 1] - g[(1 << tmp) - 1] * 2 + g[(1 << (tmp - 1)) - 1] + mod * 2) % mod;
            f[x] = (f[x] + dt * g[y]) % mod;
        }
    }
    for(int i = 1; i <= n; i++)
        printf("%lld ", f[i]);
    return 0;
}