#include<bits/stdc++.h> 
using namespace std;
#define int long long
#define rep(i, j, k) for(int i = j; i <= k; ++ i)
#define drp(i, j, k) for(int i = j; i >= k; -- i)
const int N = 8e5 + 10, Mod = 998244353;
int fpow(int a, int b){
	int x = 1;
	while(b){
		if(b & 1) x = x * a % Mod;
		a = a * a % Mod;
		b >>= 1;
	}
	return x;
}
int inv2;
int pri[N], ispri[N], b[N][2], c[N], g[N], w[N], P, E;
void prpr(int n){
	inv2 = fpow(2, Mod - 2);
	rep(i, 1, n) ispri[i] = 1;
	rep(i, 2, n){
		if(ispri[i]){
			pri[++P] = i;
			// c[P] = (c[P - 1] + 1);
		}
		rep(j, 1, P){
			if(i * pri[j] > n) break;
			ispri[i * pri[j]] = 0;
			if(i % pri[j] == 0) break;
		}
	}
}
int ans = 1, z[N];
#define id(x) (x <= E ? b[x][0]: b[n / (x)][1])
void calc(int n){
	E = sqrt(n);
	int t = 0, l = 1, r, q;
	for(; l <= n; l = r + 1){
		q = w[id(n / l) = ++ t] = n / l; r = (n / q);
		z[t] = (r - l + 1);
		int num = w[t] % Mod;
		g[t] = num + Mod - 1;
		g[t] %= Mod;
		// g[t] = (g[t] + Mod - 1) % Mod;
	}
	// cout << t << endl;
	// rep(i, 1, t) cout << g[i] << endl;
	// t--;
	rep(i, 1, P) rep(j, 1, t){
		if(pri[i] * pri[i] > w[j]) break;
		q = id(w[j] / pri[i]);
		g[j] = (g[j] - g[q] + i - 1 + Mod) % Mod;
	}
	rep(i, 1, t){
		q = id(w[i] / 2);
		g[i] = (g[i] - g[q] + Mod) % Mod;
	}
	// rep(i, 1, t) cout << g[i] << endl;
	rep(i, 1, t - 1){
		int m = w[i] % Mod;
		int f_tt = (m - g[i] - 1) % Mod * fpow(m, g[i]) % Mod;
		if(m - g[i] - 1 == 0) f_tt = fpow(m, g[i] - 1);
		// cout << f_tt << endl;
		ans = ans * fpow(f_tt, z[i]) % Mod;
	}
	// ans = ans * fpow(fpow(w[t - 1], g[t - 1] - 1), z[t - 1]) % Mod;
	cout << ans << endl;
}
signed main(){
	ios::sync_with_stdio(0);
	prpr(4e5);
	int n; cin >> n;
	calc(n);
	
}