#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int X;
  cin >> X;
  int LOG = 31 - __builtin_clz(X);
  vector<vector<long long>> pre(LOG + 2, vector<long long>(X + 1, 0));
  pre[0][0] = 1;
  for (int i = 0; i <= LOG; i++){
    pre[i + 1] = pre[i];
    for (int j = 1 << i; j <= X; j++){
      pre[i + 1][j] += pre[i + 1][j - (1 << i)];
      pre[i + 1][j] %= MOD;
    }
  }
  vector<long long> ans(X + 1, 0);
  for (int i = 1; i <= X; i++){
    int m = 31 - __builtin_clz(i);
    if (i == (1 << (m + 1)) - 1){
      ans[i] = pre[m + 1][i];
    } else {
      int L = max(1 << (m - 1), i - (1 << m) + 1);
      int R = min(1 << m, i - (1 << (m - 1)) + 1);
      vector<int> l(m + 1), r(m + 1);
      l[0] = L;
      r[0] = R;
      for (int j = 0; j < m; j++){
        int t = i >> j & 1;
        l[j + 1] = (l[j] - t + 1) / 2;
        r[j + 1] = (r[j] + 1) / 2;
      }
      vector<long long> dp(m + 1, 0);
      for (int j = 0; j <= m; j++){
        if (l[j] == r[j]){
          dp[j] = pre[j][i & ((1 << j) - 1)];
          for (int k = 0; k < j; k++){
            dp[j] -= dp[k] * pre[j - k][(i >> k) & ((1 << (j - k)) - 1)] % MOD;
            if (dp[j] < 0){
              dp[j] += MOD;
            }
          }
          ans[i] += dp[j] * pre[m - j + 1][i >> j] % MOD;
        }
      }
      ans[i] %= MOD;
    }
  }
  for (int i = 1; i <= X; i++){
    cout << ans[i];
    if (i < X){
      cout << ' ';
    }
  }
  cout << endl;
}