#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 632454
#define mod 998244353
using namespace std;
long long read()
{
	char c=0;
	long long sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
void Adder(int &x,int d)
{
	x=x+d>=mod?x+d-mod:x+d;
	return;
}
int sn,ans=1,tong[N+1],length,leng;
long long n,st[N+1],dp[N+1];
bool nprime[N+1];
int get(long long x)
{
	return x<=sn?x:leng-n/x+1;
}
int fast_pow(int a,long long b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
int solve(long long x)
{
	if (x==1) return 1;
	else if (x==2) return 1;
	else if (x==3) return 3;
	else
	{
		long long d=dp[get(x)]-dp[get(x>>1)];
		return 1ll*((x-1-d)%mod)*fast_pow(x%mod,d)%mod;
	}
}
int main()
{
	long long d;
	n=read();
	while (1ll*(sn+1)*(sn+1)<=n) ++sn;
	for (int i=2;i<=sn;++i)
		if (!nprime[i])
		{
			tong[++length]=i;
			for (int j=(i<<1);j<=sn;j+=i) nprime[j]=1;
		}
	for (long long i=1,lst;i<=n;i=lst+1) lst=n/(n/i),st[++leng]=n/i;
	reverse(st+1,st+leng+1);
	for (int i=1;i<=leng;++i) dp[i]=st[i]-1;
	for (int i=1;i<=length;++i)
		for (int j=leng;j>=1&&st[j]>=1ll*tong[i]*tong[i];--j)
			dp[j]-=(dp[get(st[j]/tong[i])]-i+1);
	for (int i=1;i<=leng;++i) d=n/st[i]-n/(st[i]+1),ans=1ll*ans*fast_pow(solve(st[i]),d)%mod;
	printf("%d\n",ans);
	return 0;
}