//g++ 1.cpp -std=c++14 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;

#define fi first
#define se second
#define pb push_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

constexpr ll mod = 998244353;

map<ll,ll> value;

// sum g[0] + ... + g[x]
ll h(ll x){
  if(x<=1){
    return x;
  }
  if(value[x]!=0){
    return value[x];
  }
  ll res=0;
  ll n;

  if(x>=2){
    //even g[2]+g[4]+...+g[2n] = g[1]+g[2]+...+g[n]+n
    n=x/2;
    res+=h(n)+n;
  }

  if(x>=1){
    //1 mod 4 g[1]+g[5]+...+g[4n+1] = g[0]+g[4]+...+g[4n]+n+1 = g[4]+...+g[4n]+n+1 = g[1]+...+g[n]+3n+1
    n=(x-1)/4;
    res+=h(n)+3*n+1;
  }

  if(x>=3){
    //3 mod 4 g[3]+g[7]+...+g[4n+3] = g[4]+g[8]+...+g[4n+4]+n+1 = g[1]+...+g[n+1]+3n+3
    n=(x-3)/4;
    res+=h(n+1)+3*n+3;
    res--;
  }

  res%=mod;
  value[x]=res;

  return res;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  ll n;
  cin>>n;
  cout<<h(n)%mod<<endl;
}