#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e6+5,M=N*120+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
ll mpow(ll x,ll y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
ll n,k;
int getid(ll x){
	return x<=k?x:k+n/x;
}
namespace Mu{
	ll f[N];
	ll id[N];int ih;
	const int M=2e7+5;
	int flag[M],pr[M],mu[M],ph;
	void init(){
		const int m=M-5;
		mu[1]=1;
		for(int i=2;i<=m;i++){
			if(!flag[i]) pr[++ph]=i,mu[i]=-1;
			for(int j=1;j<=ph&&i*pr[j]<=m;j++){
				flag[i*pr[j]]=1;
				if(i%pr[j]==0) break;
				mu[i*pr[j]]=-mu[i];
			}
		}
		for(int i=1;i<=m;i++) mu[i]+=mu[i-1];
		
		for(ll l=1,r;l<=n;l=r+1){
			r=n/(n/l);
			id[++ih]=n/l;
		}
		reverse(id+1,id+ih+1);
		for(int i=1;i<=ih;i++){
			int v=getid(id[i]);
			if(id[i]<=m){f[v]=mu[id[i]];continue;}
			f[v]=1;
			for(ll l=2,r;l<=id[i];l=r+1){
				r=id[i]/(id[i]/l);
				f[v]-=f[getid(id[i]/l)]*(r-l+1);
			}
		}
	}
}
namespace Pow{
	const int B=(1<<15),N=B+5;
	ll p1[N],p2[N];
	void init(int x){
		for(int i=p1[0]=1;i<=B;i++) p1[i]=p1[i-1]*x%mod;
		for(int i=p2[0]=1;i<=B;i++) p2[i]=p2[i-1]*p1[B]%mod;
	}
	ll qry(ll x){
		x%=Mod;
		if(x<B) return p1[x];
		return p1[x&(1<<15)-1]*p2[x>>15]%mod;
	}
}

int vis[N];ll f[N],g[N],dp[N];
ll ask(ll x){
	return (Pow::qry(x/2)-1+Pow::qry(x-1>>1)-1-x)%mod;
}
void calc(ll n){
	int v=getid(n);vis[v]=1;
	// gdb(n);
	g[v]=Pow::qry(n)-1;
	for(ll l=2,r;l<=n;l=r+1){
		r=n/(n/l);
		int u=getid(n/l);
		if(!vis[u]) calc(n/l);
		g[v]+=(Mu::f[getid(r)]-Mu::f[getid(l-1)])*(Pow::qry(n/l)-1);
		ll w=ask(r)-ask(l-1);
		(f[v]+=(dp[u]+g[u]-Pow::qry(n/l-1))*(r-l+1)+w*(g[u]*2-1+(f[u]+dp[u])*2))%=mod;
		dp[v]+=(f[u]*2+dp[u]+Pow::qry(n/l-1)-1)*(r-l+1);
		// if(n==5) gdb(f[n]);
	}
	g[v]=(g[v]%mod+mod)%mod;
	f[v]=(f[v]%mod+mod)%mod;
	dp[v]=(f[v]-dp[v]%mod+mod)%mod;
	// gdb(n,f[n],g[n],dp[n]);
}
void Solve(){
	scanf("%lld",&n);
	k=sqrt(n);
	Mu::init();
	Pow::init(2);
	calc(n);
	printf("%lld\n",(f[getid(n)]+mpow(2,n-1))%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}