#include <bits/stdc++.h>
#define LL long long
using namespace std;

int read() {
	int s = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
		s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
	return s * f;
}

const int MAXN = 1e6 + 5, mod = 998244353;

int qpow(int a, LL b) {
	int res = 1;
	while (b) {
		if (b & 1)
			res = 1ll * res * a % mod;
		a = 1ll * a * a % mod, b >>= 1;
	}
	return res;
}

LL n, N;

bool vis[MAXN];
int pr[MAXN], tot = 0;

int m, v[MAXN];
LL g1[MAXN];
int id1[MAXN], id2[MAXN];

void szs() {
	for (int i = 2; i <= N; i++) {
		if (!vis[i])
			pr[++tot] = i;
		for (int j = 1; i * pr[j] <= N; j++) {
			vis[i * pr[j]] = true;
			if (i % pr[j] == 0)
				break;
		}
	}
}

int id(LL x) {
	return x <= N ? id1[x] : id2[n / x];
}

int calc(LL m) {
	if (m <= 2) return 1;
	if (m == 3) return 3;
	LL c = g1[id(m)] - g1[id(m / 2)];
	return 1ll * qpow(m % mod, c) * ((m - c - 1 + mod) % mod) % mod;
}

signed main() {
	n = read(), N = sqrt(n);
	szs();
	for (int l = 1, r; l <= n; l = r + 1) {
		r = n / (n / l), v[++m] = n / l;
		g1[m] = n / l - 1;
		v[m] <= N ? id1[v[m]] = m : id2[n / v[m]] = m;
	}
	for (int i = 1; i <= tot; i++)
		for (int j = 1; pr[i] * pr[i] <= v[j]; j++)
			g1[j] -= g1[id(v[j] / pr[i])] - (i - 1);
	int ans = 1;
	for (LL l = 1, r; l <= n; l = r + 1)
		r = n / (n / l), ans = 1ll * ans * qpow(calc(n / l), r - l + 1) % mod;
	printf("%d", ans);
	return 0;
}