#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=1e7+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 n,g[N],w[N],wh;int m,pr[N],ph,Fl[N],i1[N],i2[N];
int getid(ll x){return x<=m?i1[x]:i2[n/x];}
void init(ll n){
	m=sqrt(n);
	for(int i=2;i<=m;i++){
		!Fl[i]&&(pr[++ph]=i);for(int j=1;j<=ph&&i*pr[j]<=m;j++) {Fl[i*pr[j]]=1;if(i%pr[j]==0) break;}
	}
	for(ll i=1,j;i<=n;i=j+1) j=n/(n/i),w[++wh]=n/j,(w[wh]<=m?i1[w[wh]]:i2[n/w[wh]])=wh;
	for(int i=1;i<=wh;i++) g[i]=w[i]-1;
	for(int i=1;i<=ph;i++){
		for(int j=1;j<=wh&&1ll*pr[i]*pr[i]<=w[j];j++) {
			int k=getid(w[j]/pr[i]);
			g[j]-=g[k]-(i-1);
		}
	}
}
ll qry(ll x){return g[getid(x)];}
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 calc(ll x){
	if(x==1||x==2) return 1;
	if(x==3) return 3;

	ll y=qry(x)-qry(x/2);
	return (x-y-1)%mod*mpow(x%mod,y)%mod;
}
void Solve(){
	scanf("%lld",&n);
	init(n);
	ll ans=1;
	for(ll i=1,j;i<=n;i=j+1){
		j=n/(n/i);
		ans=ans*mpow(calc(n/i),j-i+1)%mod;
	}
	printf("%lld\n",ans);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}