#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  long long M;
  cin >> M;
  assert(M <= 10000);
  M--;
  if (M == 0){
    cout << 1 << endl;
  } else {
    int p = 64 - __builtin_clzll(M);
    vector<long long> POW((1 << p) + 1);
    POW[0] = 1;
    for (int i = 0; i < (1 << p); i++){
      POW[i + 1] = POW[i] * 2 % MOD;
    }
    long long ans = POW[(1 << p)];
    ans += MOD - POW[(1 << p) - M - 1];
    for (long long c = 0; c < (1 << p); c++){
      for (long long d = c; d < (1 << p); d++){
        if ((c ^ d) > M){
          ans += MOD - POW[(1 << p) - 1 - d + c];
        }
      }
    }
    ans %= MOD;
    cout << ans << endl;
  }
}