#include<bits/stdc++.h>
#define int long long 
using namespace std;
const int N=1e6+10;
const int MOD=998244353;

int powM(int a,int b=MOD-2){
	int ans=1;
	a%=MOD;
	while(b){
		if(b&1)ans=ans*a%MOD;
		a=a*a%MOD;
		b>>=1;
	}
	return ans;
}

int p[N],ptot;
bool isp[N];
int lim,n;
void ini(){
	for(int i=2;i<=lim;++i){
		if(!isp[i])p[++ptot]=i;
		for(int j=1;j<=ptot&&p[j]*i<=lim;++j){
			isp[p[j]*i]=true;
			if(i%p[j]==0)break;
		}
	}
}

int idx1[N],idx2[N],val[N],cnt[N];
inline int getid(int x){
	if(x<=lim)return idx1[x];
	return idx2[n/x];
}

int g[N];

void llz(){
	cin>>n;
	lim=min(n,(int)sqrtl(n)+1);
	ini();
	int idxtot=0;
	for(int l=1,r;l<=n;l=r+1){
		r=n/(n/l);
		val[++idxtot]=n/l;
		if(n/l<=lim)idx1[n/l]=idxtot;
		else idx2[l]=idxtot;
		g[idxtot]=n/l-1;
		cnt[idxtot]=r-l+1;
	}
	for(int j=1;j<=ptot;++j){
		for(int i=1;i<=idxtot&&p[j]*p[j]<=val[i];++i){
			g[i]=(g[i]-(g[getid(val[i]/p[j])]-g[getid(p[j-1])]));
		}
	}
	int ans=1;
	for(int i=1;i<idxtot;++i){
		int np=g[i]-g[getid(val[i]/2)];
		int k=np+1;
		if(np+1<val[i])k++;
		int res;
		if(k-2>=0)res=max(val[i]-np-1,1ll)%MOD*powM(val[i],k-2)%MOD;
		else res=1;
		ans=ans*powM(res,cnt[i])%MOD;
	}
	cout<<ans<<"\n";
}

signed main(){
	iostream::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	ini();
	int T=1;
	while(T--)llz();
	return 0;
}