#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int mo = 998244353;
using ll = long long;
ll sum[N], dp[N];

int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    dp[i] = sum[i - 1] + 1;
    int cur = i;
    int x = 1;
    while (cur) {
      if ((cur & 1) && cur != 1) {
        (dp[i] += (mo - sum[min((x << 1) - 1, i)] + sum[min(x - 1, i)]) % mo) %= mo;
      }
      cur >>= 1;
      x <<= 1;
    }
    sum[i] = (sum[i - 1] + dp[i]) % mo;
  }
  printf("%lld\n", sum[n]);
}