#include<bits/stdc++.h>
using namespace std;
#define pr pair<int, int>
#define pb push_back
#define mid (l + r) / 2
#define ls num << 1
#define rs num << 1 | 1

inline int read() {
    int x = 0, m = 1;
    char ch = getchar();

    while (!isdigit(ch)) {
        if (ch == '-') m = -1;
        ch = getchar();
    }

    while (isdigit(ch)) {
        x = x * 10 + ch - 48;
        ch = getchar();
    }

    return x * m;
}

inline void write(int x) {
    if (x < 0) {
        putchar('-');
        write(-x);
        return;
    }

    if (x >= 10) write(x / 10);
    putchar(x % 10 + '0');
}

const int N = 1e6 + 5, M = 20, mod = 998244353;

int add(int x, int y) {
    return (x + y >= mod) ? (x + y - mod) : (x + y);
}

int sub(int x, int y) {
    return (x - y < 0) ? (x - y + mod) : (x - y);
}

void Add(int &x, int y) {
    x += y;
    if (x >= mod) x -= mod;
}

void Sub(int &x, int y) {
    x -= y;
    if (x < 0) x += mod;
}

int ans[N], f[N][M], g[M];

signed main() {
    int n = read(), m = 0;
    for (int i = 0; i < 20; i++) f[0][i] = 1;
    g[0] = 1;
    for (int i = 1; i <= n; i++) {
        int sum = 0;
        for (int j = 0; j < 20; j++) {
            if ((1 << j) <= i) Add(sum, f[i - (1 << j)][j]);
            f[i][j] = sum;
        }
        if ((i + 3) == ((i + 3) & (-(i + 3)))) {
            m++;
            g[m] = f[i][19];
            for (int j = 0; j < m - 1; j++) {
                Sub(g[m], 1ll * g[j] * f[(1 << (m + 1)) - 1 - (((1 << (j + 1)) - 1) << (m - j)) - 2][m - j] % mod);
            }
        }
        int x = 0, ans = 0, lim = 0;
        for (int j = __lg(i); j >= 0; j--) {
            if ((i >> j) & 1) {
                lim = lim << 1 | 1;
                Add(ans, 1ll * f[i - (lim << j)][19] * g[x] % mod);
                x++;
            }
            else break;
        }
        write(ans);
        putchar(" \n"[i == n]);
    }
}