#pragma GCC optimize("Ofast,inline,unroll-loops")
#include<bits/stdc++.h>
using ll=long long;
constexpr int B=320000,M=998244353;
auto qpow(ll a,auto b){int res=1;for(;b;a=a*a%M,b>>=1)if(b&1)res=res*a%M;return res;}
int v[B];
std::vector<int>prime;
ll n;
using Info=std::array<ll,2*B>;
auto&access(Info&a,ll x){
	if(x<=B)return a[x+B];
	return a[n/x];
}
signed main(){
	v[1]=1;
	prime.reserve(27608);
	for(int i=2;i<B;++i){
		if(!v[i]){
			v[i]=i;
			prime.emplace_back(i);
		}
		for(auto&p:prime){
			if(i*p>=B)break;
			v[i*p]=p;
			if(v[i]==p)break;
		}
	}
	std::cin>>n;
	std::vector<ll>b;
	Info f={};
	for(ll l=1,r;l<=n;l=r+1){
		ll q=n/l;
		r=n/q;
		b.emplace_back(q);
		access(f,q)=q-1;
	}
	for(int j=0;j<ssize(prime);++j){
		for(int i=0;prime[j]*(ll)prime[j]<=b[i];++i){
			access(f,b[i])-=access(f,b[i]/prime[j])-j;
		}
	}
	ll ans=1;
	for(ll l=1,r;l<=n;l=r+1){
		ll q=n/l;
		r=n/q;
		// std::cerr<<l<<' '<<r<<' '<<q<<'\n';
		ans=(ans*qpow([&]->ll{
			if(q==1)return 1;
			if(q==2)return 1;
			if(q==3)return 3;
			// int c=pi[q]-pi[q/2];
			ll c=access(f,q)-access(f,q/2);
			return (q-c-1)%M*qpow(q%M,c)%M;
		}()%M,r-l+1))%M;
	}
	printf("%lld\n",ans);
}