#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 6, MOD = 998244353;
int n, f[N], h[N], g[N];
int main() {
	cin >> n, f[0] = 1;
	for (int i=1; i<=n; i++)
		f[i] = (f[i-1] + (i & 1 ? 0 : f[i>>1])) % MOD, 
		h[i] = __lg(i) ^ __lg(i + 1) ? __lg(i + 1) : h[i>>1];
	for (int i=1; i<=20; i++) {
		g[i] = f[(1<<i)-1];
		for (int j=1; j<i; j++)
			g[i] = (g[i] + 1ll * (MOD - g[j]) * f[(1<<i-j)-1]) % MOD;
	}
	for (int i=1; i<=n; i++) {
		int ans = 0;
		for (int j=1; j<=h[i]; j++)
			ans = (ans + 1ll * g[j] * f[i^(1<<j)-1<<__lg(i)-j+1]) % MOD;
		printf ("%d ", ans);
	}
}