#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const 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;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}

ll jyo(ll x,ll y,ll z){
  ll H=y; //ここから
       ll a=1,b=(x%z+z)%z,c=1;
       while(H>0){
         a*=2;
         if(H%a!=0){
           H-=a/2;
           c*=b;
           c%=z;
         }
        b*=b;
         b%=z;
      } //ここまで
 return c;
}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll N;
	cin>>N;
	ll T=1,C=0;
	ll ans=0;
	ll rev=(mod+1)/2;
	while(true){
		T*=2,C++;
		if(T/2-1>=N){
			ll A_ave=jyo(T+2,mod-2,mod);
			ll R=(A_ave*4)%mod;
			ans=(ans+(A_ave*R)%mod)%mod;
			break;
		}
		ll U=jyo(T/2+1,mod-2,mod),D=jyo(T+1,mod-2,mod);
		ll R=((U-D)*2ll)%mod;
		ll A_ave=((U+D)*rev)%mod;
		ll B_ave=(mod+1-A_ave)%mod;
		ll rem=N-T+1;
		ll ca=1,cb=T;
		int x=1;
		while(true){
			if(rem<=0){
				ll tmp=(R+mod)%mod;
				if(x%2==0){
					tmp=(tmp*((A_ave*jyo(ca,mod-2,mod))%mod))%mod;
				}else{
					tmp=(tmp*((B_ave*jyo(cb,mod-2,mod))%mod))%mod;
				}
				ans=(ans+tmp)%mod;
				break;
			}
			if(x%2){
				rem-=ca;
				ca*=2;
			}else{
				rem-=cb;
				cb*=2;
			}
			x++;
		}
	}
	cout<<(ans+mod)%mod<<"\n";
}