#include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 998244353
int n, f[1000005], g[23];
signed main() {
	cin >> n;
	f[0] = 1;
	for (int i = 1; i <= 1e6; i <<= 1) {
		for (int j = i; j <= 1e6; j++) {
			f[j] += f[j - i];
			f[j] %= MOD;
		}
	}
	for (int i = 0; i < 20; i++) {
		g[i] = f[(1 << i) - 1];
		for (int j = 1; j < i; j++) {
			g[i] -= g[j] * f[(1 << i - j) - 1] % MOD;
			g[i] = (g[i] % MOD + MOD) % MOD;
		}
	}
	for (int i = 1; i <= n; i++) {
		int ans = 0, k = __lg(i);
		for (int j = k; j >= 0; j--) {
			if (i & (1 << j)) {
				ans += g[k - j + 1] * f[i % (1 << j)] % MOD;
				ans %= MOD;
			} else {
				break;
			}
		}
		cout << ans << " ";
	}
	return 0;
}