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

const int MXN = 1000005;
const int DVS = 998244353;
int N, cnt[MXN], bcnt[MXN];

int main() {
  cin >> N;
  cnt[0] = bcnt[0] = 1;
  for (int i(1); i <= N; i <<= 1) {
    for (int j(i); j <= N; ++j) cnt[j] = (cnt[j] + cnt[j - i]) % DVS;
  }
  for (int i(1); i <= N; ++i) {
    bcnt[i] = cnt[i];
    for (int j(1); j <= i; j <<= 1)
      if (i & j)
        bcnt[i] = (bcnt[i] - bcnt[i / j - 1] * 1LL * cnt[i % j] % DVS + DVS) % DVS;
  }
//  for (int i(1); i <= N; ++i) cout << cnt[i] << ' ';
//  cout << endl;
//  for (int i(1); i <= N; ++i) cout << bcnt[i] << ' ';
//  cout << endl;
  for (int i(1); i <= N; ++i) {
    int hb(1);
    while (hb <= i) hb <<= 1;
    hb >>= 1;
    int d(min(i - hb, 2 * hb - 2 - i));
    int o(0);
    for (int j(1); j <= i; j <<= 1)
      if (i & j && j - (i % j) > d)// cout << i << ':' << j << endl,
        o = (o + bcnt[i / j - 1] * 1LL * cnt[i % j] % DVS) % DVS;
    cout << o << ' ';
  }
  cout << endl;
  return 0;
}