#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll const m = 998244353;
ll mpow(ll a, ll n) {
	n %= (m - 1);
	ll ret = 1;
	while (n) {
		if (n & 1) ret = (ret * a) % m;
		a = (a * a) % m;
		n >>= 1;
	}
	return ret;
}
int main() {
	ll N;
	cin >> N;
	if (N < 3) {
		if (N == 1) {
			puts("1");
		}
		if (N == 2) {
			puts("3");
		}
		return 0;
	}
	N --;
	ll n = 1; int lg = -1;
	while (n <= N) {
		n <<= 1;
		lg ++;
	}
	n >>= 1;
	ll ans = mpow(2, n) - 1;
	ll dp[60][3];
	if (N & 1) {
		dp[0][1] = 2 + (m + 1) / 2; dp[0][0] = 2; dp[0][2] = 0;
	} else {
		dp[0][0] = 0; dp[0][1] = 2;dp[0][2] = 2 + (m + 1) / 2;
	}
	for (int i = 1; i < lg; i ++) {
		ll* pre = dp[i - 1];
		ll* now = dp[i];
		ll b = mpow(2, (1ll << i));
		ll iv = mpow(b, m - 2);
		if ((N >> i) & 1) {
			now[0] = (pre[0] + pre[1] + pre[2]) * 2; now[0] %= m;
			now[1] = 0; now[2] = 0;
			for (int j = 0; j < 3; j ++) {
				now[j] += pre[j] * (b + iv) % m;
				now[j] %= m;
			}
		} else {
			for (int j = 0; j < 3; j ++) {
				now[j] = pre[j] * 2;
				now[j] %= m;
			}
			now[2] += (pre[0] + pre[1] + pre[2]) * ((b + iv) % m);
			now[2] %= m;
		}
	}
	ll kj = dp[lg - 1][0] + dp[lg - 1][1];
	kj %= m;
	kj = (kj * mpow(2, (1ll << lg) - 1)) % m;
	cout << (ans + kj) % m << endl;
}