#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(int)(n); i++)


const i64 INF = 1001001001001001001;
using modint = atcoder::static_modint<998244353>;


modint triangleArea(i64 h){
    return (modint(h) * modint(h) * modint(2)).inv();
}


int main(){
    i64 N; cin >> N;
    if(N == 0){ cout << "748683265\n"; return 0; }
    modint ans = 0;
    for(i64 sh = 0; sh < 50; sh++){
        modint len = modint(((i64)1 << sh) + 1).inv() - modint(((i64)2 << sh) + 1).inv();
        modint area = triangleArea(((i64)1 << sh) + 1) - triangleArea(((i64)2 << sh) + 1);
        i64 givel = 1;
        i64 giver = ((i64)4 << sh) - 1;
        if(givel / 2 + giver / 2 >= N){ giver /= 2; givel /= 2; }
        while(givel + giver < N){ giver = giver * 2 + 1; givel = givel * 2 + 1; }
        if(givel + giver / 2 >= N){
            ans += area / modint(givel + 1);
        }
        else{
            ans += (len - area) / modint(giver + 1);
        }
    }
    ans += triangleArea(((i64)1 << 50) + 1);
    ans *= 2;
    cout << ans.val() << '\n';
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;