#include <bits/stdc++.h>

using namespace std;

#define lep(i, l, r) for(int i = (l); i <= (r); i ++)
#define rep(i, l, r) for(int i = (l); i >= (r); i --)
#define Lep(i, l, r) for(int i = (l); i <  (r); i ++)
#define debug(...) fprintf (stderr, __VA_ARGS__)
//#define int long long
using i64 = long long;
using ld = long double;
using ui64 = unsigned long long;

const int P = 998244353;
inline int mod(int x) { return x + (x >> 31 & P); }
inline void pls(int &x, int y) { x = mod(x + y - P); }
inline void sub(int &x, int y) { x = mod(x - y); }
inline int  add(int x, int y) { return mod (x + y - P); }
inline int  dec(int x, int y) { return mod (x - y); }

inline int power(int x, i64 k) {
	int res = 1;
	while(k) {
		if (k & 1) res = 1ll * res * x % P;
		x = 1ll * x * x % P; k >>= 1;
	} return res;
}

namespace Min25 {

	#define LL long long

	LL n;

	const int N = 1e6 + 10;

	int vis[N], p[N], tot;

	void init(int n = 1e6) {
		for(int i = 2; i <= n; i ++) {
			if(! vis[i]) p[++ tot] = i;
			for(int j = 1; p[j] * i <= n && j <= tot; j ++) {
				vis[i * p[j]] = 1;
				if(i % p[j] == 0) break;
			}
		}
	}

	int id0[N], id1[N];
	LL val[N];
	int num, sqr;
	LL g[N];

	inline int pos(LL x) {
		if(x <= sqr) return id0[x];
		else return id1[n / x];
	}

	i64 qry (i64 x) {
		if (x == 0) return 0;
		if (x <= sqr) return g[id0[x]];
		else return g[id1[n / x]];
	}

	void main(i64 _n) {
		
		n = _n;
		sqr = sqrt(n) + 1;
		init(sqr);
		for(LL l = 1, r = 1; l <= n; l = r = r + 1) {
			LL tmp = n / l;
			r = n / tmp;
			val[++ num] = tmp;
			if(tmp <= sqr) id0[tmp] = num;
			else id1[n / tmp] = num;
		}
		for(int i = 1; i <= num; i ++) g[i] = val[i] - 1;
		
		for(int j = 1; j <= tot; j ++) {
			int pj = p[j];
			for(int i = 1; i <= num; i ++) {
				if(val[i] / pj < pj) break;
				g[i] = g[i] - g[pos(val[i] / pj)] + j - 1;
			}
		}
		
		//cout << g[1] << endl;
		//return 0;
	}
}

i64 n;

inline int f(i64 m) {
	if (m <= 2) return 1;
	if (m == 3) return 3;
	// calc [m / 2 + 1, m]
	i64 cnt = Min25 :: qry(m) - Min25 :: qry(m / 2);
	
	return (m - cnt - 1) % P * power (m, cnt % (P - 1)) % P;
}

int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	Min25 :: main(n);
	i64 ans = 1;
	for (i64 l = 1, r; l <= n; l = r + 1) {
		r = n / (n / l);
		ans = 1ll * ans * power (f(n / l), r - l + 1) % P;
	}
	cout << ans << '\n';
	return 0;
}