#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define dwn(i,a,b) for(int i=a;i>=b;i--)
#define lowbit(x) (x&(-x))
#define MAXN 1002501
#define N 1000000
#define int long long
#define mp(x,y) make_pair(x,y)
using namespace std;
typedef long long ll;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch>'9' || ch<'0'){if(ch=='-') f=-1; ch=getchar();}
	while('0'<=ch && ch<='9') x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
	return x*f;
}
const int mod = 998244353;
int pri[MAXN],cnt,bk[MAXN],id1[MAXN],id2[MAXN],n;
int w[MAXN],tot,g[MAXN],sp[MAXN],ans;
void Add(int &x,int y){
	x += y;
	if(x >= mod) x -= mod;
	if(x < 0) x += mod;
}
int ksm(int x,int y){
	x %= mod;
	int res = 1;
	while(y){
		if(y&1) res = res * x % mod;
		x =  x * x % mod;
		y>>=1;
	}
	return res;
}
void shai(){
	rep(i,2,N){
		if(!bk[i]){
			bk[i] = i;
			pri[++cnt] = i;
			sp[cnt] = (sp[cnt-1] + 1) % mod;
		}
		rep(j,1,cnt){
			if(i * pri[j] > N || bk[i] < pri[j]) break;
			bk[i*pri[j]] = pri[j];
		}
	}
}
void pre(){
	n = read();
	for(int l = 1,r; l <= n; l = r + 1){
		r = n/(n/l);
		ll k = n/l;
		w[++tot] = k;
		if(k <= N) id1[k] = tot;
		else id2[n/k] = tot;
		g[tot] = (k-1)%mod;
	}
	int l,k;
	rep(i,1,cnt){
		rep(j,1,tot){
			if(w[j] < pri[i] * pri[i]) break;
			l = w[j] / pri[i];
			if(l <= N) k = id1[l];
			else k = id2[n/l];
			Add(g[j],-(g[k]-sp[i-1])%mod);
		}
	}
}
void wk(){
	int k,j,k2,i,p;
	ll res;
	ans = 1;
	for(int l = 1,r; l <= n; l = r + 1){
		r = n / (n/l);
		k = n / l;
		if(k <= N) j = id1[k];
		else j = id2[n/k];
		k2 = k / 2;
		if(k2 <= N) i = id1[k2];
		else i = id2[n/k2];
		p = g[j] - g[i] + 2;
		if(p > k) p = k;
		if(p == 1) res = 1;
		else if(p == k) res = ksm(k,k-2);
		else if(p == 2) res = k-1;
		else res = ksm(k,p-2) * ((k-p+1)%mod) % mod;
		res %= mod;
//		if(res < 0) cout<<"QAQ";
		ans = ans * ksm(res,r-l+1) % mod;
	}
}
signed main(){
	shai();
	pre();
	wk();
	cout << ans;
	return 0;
}