#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <array>
#include <queue>
#include <set>
#include <map>
using namespace std;

using ll = long long;

constexpr ll MOD = 998244353ll;

constexpr int N = 1e6 + 5;

array<ll, N> f, g;
int n;

inline int highbit(int x)
{
	if (x == 0) return -1;
	return (int)log2(x);
}

int main()
{
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> n;
	f[0] = 1ll;
	for (int i = 0; i < 20; i++)
	{
		for (int j = (1 << i); j < N; j++)
		{
			f[j] = (f[j] + f[j - (1 << i)]);
			(f[j] >= MOD ? f[j] -= MOD : 0);
		}
	}
	g[0] = 1;
	for (int i = 1; i <= n; i++)
	{
		for (int k = 0; k < 20; k++)
		{
			if (i % (1 << k) || i < (1 << (k + 1))) continue;
			g[i] = (g[i] + f[1 << k] * g[(i - (1 << (k + 1))) >> k] % MOD);
			g[i] >= MOD ? g[i] -= MOD : 0;
		}
	}
	for (int i = 1; i <= n; i++)
	{
		ll ans = 0ll;
		for (int k = 0; k < 20; k++)
		{
			if ((1 << k) > i) break;
			int x = (1 << k) - (i % (1 << k));
			if (i < ((1 << k) + (1 << k) - x) || highbit((i + x) >> 1) == highbit((i - x) >> 1)) continue;
			//cout << "!!: " << i << " " << k << " " << x << "\n";
			int ns = i - (1 << k) - ((1 << k) - x);
			if (ns % (1 << k)) continue;
			ll val = f[(1 << k) - x] * g[ns >> k] % MOD;
			ans = (ans + val);
			ans >= MOD ? ans -= MOD : 0;
		}
		cout << ans << " ";
	}
	cout << "\n";
	return 0;
}