#include <bits/stdc++.h>
#define bit(x) (1LL << (x))
#define lowbit(x) (x & (-x))
#define SQU(x) ((x) * (x))
#define ls id << 1
#define rs id << 1 | 1
//#define int long long
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 2e5 + 5;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const int inv2 = (mod + 1) / 2;
ll qpow(ll x,ll y) {
    ll res = 1;
    while(y) {
        if(y & 1) res = res * x % mod;
        x = x * x % mod;
        y >>= 1;
    }
    return res;
}
void add(int &x,int y) {
    x += y;
    if(x >= mod) x -= mod;
}
const int dx[] = {0,0,1,-1};
const int dy[] = {1,-1,0,0};
void solve() {
	int n;cin >> n;
	vector <ll> dp(n + 1),f(n + 1,-1);
	dp[0] = 1;
	for(int i = 1;i <= n;i <<= 1) {
		for(int j = i;j <= n;j++) {
			dp[j] = (dp[j] + dp[j - i]) % mod;
		}
	}
	
	function <ll(int,int)> dfs = [&] (int x,int rem) {
		if(rem == -1) return 1LL;
		if(!(x & bit(rem))) return 0LL;
		if(f[x] != -1) return f[x];
		auto &ans = f[x];
		ans = 0;
		int now = x;
		x -= bit(rem);
		ans = (ans + dp[x]) % mod;
		if(x) ans = (ans + dfs(x,rem - 1)) % mod;
		//cout << now << ' ' << ans << '\n';
		return ans;
	};
	for(int i = 1;i <= n;i++) {
		int j = 0;
		while(bit(j) <= i) j += 1;
		if(i == bit(j) - 1) f[i] = dp[i];
		else dfs(i,j - 1);
		cout << f[i] << ' ';
	}
}
 
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(20);
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    int T = 1;
//    cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}
/*
*/