#include <iostream>
#include <cmath>
#include <atcoder/modint>
#include <map>

using namespace std;
using namespace atcoder;
using mint = modint998244353;
using ll = long long;
mint pw(mint a,ll x){
    if(x<0) a = 1/mint(a);
    x = abs(x);
    mint ret = 1;
    while(x){
        if(x&1) (ret *= a);
        x /= 2; a *= a;
    }
    return ret;
}

map<pair<ll,ll>,mint> mp;
ll mx = -10000;
mint solve(ll z,ll dig){
    if(z<0 || dig<0) return 0;
    if(dig==0) return 1;
    if(z==0) return mint(1LL<<dig);
    if(mp.find({z,dig})!=mp.end()) return mp[{z,dig}];
    mint inv = (mint)1/(mint)2;
    return mp[{z,dig}] = 2*solve(z/2,dig - 1) + (pw(2,1LL<<(mx - dig)) + pw(2,(1LL<<(mx - dig))*(-1)))*solve((z - 1)/2,dig - 1);
}

int main(){
    ll m; cin >> m;
    int d = 0;
    ll n = m;
    while(n){
        n /= 2; d++;
    }
    mint ans = pw(2,(1LL<<(d - 1)) - 1) - 1 + pw(2,1LL<<(d - 1)) - pw(2,(1LL<<d) - m);
    mx = d - 1;
    mint val = solve(m - (1LL<<(d - 1)) - 1,d - 1) - (pw(2,m - (1LL<<(d - 1))) - 1)/pw(2,m - (1LL<<(d - 1)) - 1);
    ans += pw(2,(1LL<<(d - 1)) - 2)*val;
    ans = 2*ans + 1;
    cout << ans.val() << "\n";
}