#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define ll long long
#define all(v) v.begin(),v.end()
#define sz(v) ((ll)v.size())
#define V vector
#define vi V<int>
#define vll V<ll>
#define eb emplace_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define A array
#define pb push_back
#define mset multiset
#define gpumap __gnu_pbds::gp_hash_table
#define ccumap __gnu_pbds::cc_hash_table
#define ui unsigned int
#define ull unsigned ll
#define i128 __int128
#define cerr if (test) cerr
#define freopen if (test) freopen
#define whtest if (test)
using namespace std;

const int test = 0;

namespace jhsy {
	constexpr int P = 998244353;
	const int N = 1e6;
	A<ll,N+1> ans,c;
	void init(const int n = N) {
		c[0] = 1;
		for (int i = 1; i <= n; i++) {
			if (i%2 == 1) {
				c[i] = c[i-1];
			}
			else {
				c[i] = (c[i-1]+c[i/2])%P;
			}
		}
		ans[0] = 1;
		for (int i = 1; i <= n; i++) {
			int x = __lg(i);
			if (i == (1<<x)) {
				ans[i] = 1;
			}
			else if (i+1 == (2<<x)) {
				ans[i] = c[i];
			}
			else if (i%2 == 1) {
				ans[i] = ans[i-1];
			}
			else {
				ans[i] = (ans[i-1]+ans[i/2])%P;
			}
		}
	}
	void main() {
		int n;
		cin >> n;
		for (int i = 1; i <= n; i++) {
			cout << ans[i] << " \n"[i == n];
		}
	}
}

int main() {
	freopen("test.in","r",stdin);
	freopen("test.out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(20);

	jhsy::init();

	int T = 1;
//	cin >> T;
	while (T--) {
		jhsy::main();
	}

	return 0;
}