#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long modpow(long long a, long long b){
	long long ans = 1;
	while (b > 0){
		if (b % 2 == 1){
			ans *= a;
			ans %= MOD;
		}
		a *= a;
		a %= MOD;
		b /= 2;
	}
	return ans;
}
long long modinv(long long a){
	return modpow(a % MOD, MOD - 2);
}
long long integral(long long L, long long R, long long a, long long b){
  long long ans = 0;
  ans += R * R % MOD * modinv(2) % MOD * a % MOD;
  ans += MOD - L * L % MOD * modinv(2) % MOD * a % MOD;
  ans += (R - L + MOD) * b % MOD;
  ans %= MOD;
  return ans;
}
int main(){
  long long N;
  cin >> N;
  long long ans = 0;
  long long c = 1;
  long long R = modinv(2);
  while (true){
    if (N <= (long long) (1 << (c - 1)) - 1){
      ans += integral(0, R, 1, 0);
      break;
    }
    long long L = modinv(((long long) 1 << c) + 1);
    long long N2 = N;
    N2 -= ((long long) 1 << c) - 1;
    long long b = modinv((long long) 1 << c);
    long long a = MOD - b;
    long long x = 1, y = (long long) 1 << c;
    int t = 0;
    while (N2 > 0){
      if (t % 2 == 0){
        N2 -= x;
        b = 0;
        a = modinv((long long) 1 << (t / 2 + 1));
        x *= 2;
      } else {
        N2 -= y;
        b = modinv((long long) 1 << (c + 1 + t / 2));
        a = MOD - b;
        y *= 2;
      }
      t++;
    }
    ans += integral(L, R, a, b);
    c++;
    R = L;
  }
  ans %= MOD;
  ans *= 2;
  ans %= MOD;
  cout << ans << endl;
}