#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <bitset>
#include <queue>
#define int long long
using namespace std;

const int md=998244353,B=320000;
void read(int &x){
	x=0;
	int f=1;
	char c=getchar();
	while(!('0'<=c && c<='9')){
		if(c=='-'){
			f=-1;
		}
		c=getchar();
	}
	while('0'<=c && c<='9'){
		x=(x<<3)+(x<<1)+(c^48);
		c=getchar();
	}
	x*=f;
}
int powr(int b,int k){
	b%=md;
	int res=1;
	for(;k;k>>=1,b=b*b%md){
		if(k&1){
			res=res*b%md;
		}
	}
	return res;
}
int ps[100010],cnt=0;
bool isp[1000010];
void sieve(int n){
	memset(isp,1,sizeof(isp));
	isp[0]=isp[1]=0;
	for(int i=2;i<=n;i++){
		if(isp[i]){
			ps[++cnt]=i;
		}
		for(int j=1;j<=cnt && ps[j]*i<=n;j++){
			isp[ps[j]*i]=0;
			if(i%ps[j]==0){
				break;
			}
		}
	}
}
int n,sum1[1000010],sum2[1000010];
int getres(int k){
	if(n/k<=2){
		return 1;
	}else if(n/k==3){
		return 3;
	}else{
		int cur=((n/k<=B?sum1[n/k]:sum2[k])-(n/(2*k)<=B?sum1[n/(2*k)]:sum2[2*k]))%md;
		return (n/k-cur-1)%md*powr(n/k,cur)%md; 
	}
}
signed main(){
	sieve(B);
	read(n);
	for(int i=1;i<=min(B,n);i++){
		sum1[i]=i-1;
	}
	for(int i=1;i<=B;i++){
		if(n/i<=B){
			break;
		}
		sum2[i]=n/i-1;
	}
	for(int j=1;j<=cnt;j++){
		int p=ps[j];
		if(p*p>n){
			break;
		}
		for(int i=1;i<=B;i++){
			if(n/i<=B){
				break;
			}
			int v=n/i;
			if(p*p>v){
				break;
			}
			sum2[i]-=(v/p<=B?sum1[v/p]:sum2[i*p])-j+1;
		}
		for(int i=B;i;i--){
			if(p*p>i){
				break;
			}
			sum1[i]-=sum1[i/p]-j+1;
		}
	}
	int res=1;
	for(int l=1,r;l<=n;l=r+1){
		r=n/(n/l);
		res=res*powr(getres(l),r-l+1)%md;
	}
	printf("%lld",res);
	return 0;
}