#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 1e6 + 5;
const ll mod = 998244353;

ll n, f[N], g[N];

inline void addmod(ll &x) {
	(x >= mod) && (x -= mod);
}

int main() {
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	cin >> n;
	g[0] = 1;
	for (int i = 1; i <= n; i <<= 1) {
		for (int j = i; j <= n; ++j) {
			addmod(g[j] += g[j - i]);
		}
	}
	f[1] = 1;
	for (int i = 2; i <= n; ++i) {
		int j = __builtin_clz(i) ^ 31;
		f[i] = g[i ^ (1 << j)];
		if (i & (1 << (j - 1))) {
			addmod(f[i] += f[i ^ (1 << j)]);
		}
		if (!(i & (i + 1))) {
			f[i] = g[i];
		}
	}
	for (int i = 1; i <= n; ++i) {
		cout << f[i] << " ";
	}
	cout << "\n";
	return 0;
}