#include <bits/stdc++.h>
const int mod = 998244353;
using namespace std;
#define int long long
int od[2000006], h[2000006], g[2000006];

signed main() {
	int n;
	cin >> n;
	od[0] = 1;
	for (int i = 1; i <= n; i++) {
		od[i] = (od[i - 1] + (int)(i % 2 == 0) * od[i / 2]) % mod;
		h[i] = (__lg(i) != __lg(i + 1) ? __lg(i + 1) : h[i >> 1]);
	}

	for (int i = 1; i <= 20; i++) {
		g[i] = od[(1 << i) - 1];
		for (int j = 1; j < i; j++) {
			g[i] = (g[i] + (mod - g[j]) * od[(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 + g[j] * od[i ^ (1 << j) - 1 << __lg(i) - j + 1]) % mod;
		}
		cout << ans << ' ';
	}
	return 0;
}