#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/modint>
using mint = atcoder::modint998244353;

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll N;
    cin >> N;
    const int D = 60;
    map<tuple<int, int, int, int>, mint> dp;
    // 1 を考えたか、下ったか、下ったか、dif
    dp[{0, 0, 0, 0}] = 1;
    for (int d = D - 1; d >= 0; d--){
        map<tuple<int, int, int, int>, mint> n_dp;
        for (auto [tmp1, val] : dp){
            rep(x, 0, 2) rep(y, 0, 2){
                auto [w, a, b, dif] = tmp1;
                if (N & (1ll << d)){
                    if (x == 0) a = 1;
                    if (y == 0) b = 1;
                }
                else{
                    if (a == 0 && x == 1) continue;
                    if (b == 0 && y == 1) continue;
                }
                if (x == 1 && y == 1 && w == 0){
                    n_dp[{1, a, b, dif}] += val;
                }
                n_dp[{w, a, b, dif + (x - y)}] += val * (w + 1);
            }
        }
        swap(n_dp, dp);
    }
    mint ans = 0;
    for (auto [tmp, val] : dp){
        auto [w, a, b, dif] = tmp;
        // cout << w << " " << a << " " << b << " " << dif << " " << val.val() << "\n";
        if (dif == 0 && w == 1) ans += val;
    }
    ans += ((mint)(N) * (mint)(N + 1)) / 2;
    ans /= 2;
    cout << ans.val() << "\n";
}