#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

const int MOD = 998244353;

int add(int a, int b) {
  if (a + b < MOD)
    return a + b;
  return a + b - MOD;
}

int sub(int a, int b) {
  if (a >= b)
    return a - b;
  return a + MOD - b;
}

int mul(int a, int b) {
  return a * 1ll * b % MOD;
}

int pw(int a, int n) {
  int ans = 1;
  while (n) {
    if (n & 1)
      ans = mul(ans, a);
    n >>= 1;
    a = mul(a, a);
  }
  return ans;
}

const int MAXN = 1e6 + 100;
int dp[MAXN], f[30];


int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);

  int n;
  cin >> n;
  dp[0] = 1;
  for (int i = 1; i <= n; ++i) {
    dp[i] = dp[i - 1];
    if (i % 2 == 0) {
      dp[i] = add(dp[i], dp[i / 2]);
    }
  }
  for (int l = 1; (1 << l) <= n + 1; ++l) {
    f[l] = dp[(1 << l) - 1];
    for (int l1 = 1; l1 < l; ++l1) {
      f[l] = sub(f[l], mul(f[l1], dp[(1 << (l - l1)) - 1]));
    }
  }

  for (int x = 1; x <= n; ++x) {
    int x1 = x;
    vector<int> bits;
    while (x1) {
      bits.push_back(x1 % 2);
      x1 /= 2;
    }
    int ans = 0;
    x1 = x;
    for (int i = (int)bits.size() - 1; i >= 0 && bits[i] == 1; --i) {
      x1 ^= (1 << i);
      ans = add(ans, mul(dp[x1], f[bits.size() - i]));
    }
    cout << ans << " ";
  }
  cout << "\n";

  
  return 0;
}