#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 5;

int c;
long long g[N];
bool ip[N];
long long ps[N], pc;
void eulerian_sieve(int n) {
    fill_n(ip + 1, n, 1);
    pc = 0;
    ip[1] = 0;
    for (int i = 2; i <= n; ++i) {
        if (ip[i]) ps[++pc] = i;
        for (int j = 1; j <= pc && i * ps[j] <= n; ++j) {
            ip[i * ps[j]] = 0;
            if (i % ps[j] == 0) break;
        }
    }
}

long long n, s, w[N];
int id(long long x) { return !x ? 0 : x > s ? n / x
                                            : c - x + 1; }
void cal_g(long long n0) {
    n = n0;
    s = sqrt(n);
    c = 0;
    for (long long l = 1, r; l <= n; l = r + 1) {
        long long v = n / l;
        r = n / v;
        w[++c] = v;
        g[c] = v - 1;
    }
    eulerian_sieve(2 * s);
    for (int j = 1; j <= pc; ++j) {
        long long p = ps[j];
        if (1ll * p * p > n) break;
        for (int i = 1; 1ll * p * p <= w[i]; ++i) {
            g[i] = (g[i] - 1ll * ((g[id(w[i] / p)] - g[id(p - 1)])));
        }
    }
}
const int mod = 998244353;
long long qpow(long long x, long long y) {
    x %= mod;
    long long res = 1;
    while (y) {
        if (y & 1) res = res * x % mod;
        x = x * x % mod;
        y >>= 1;
    }
    return res;
}
long long cal_purfer(long long x) {
    if (x <= 2) return 1;
    if (x == 3) return 3;
    long long res = g[id(x)] - g[id(x / 2)];

    res = (x % mod - res - 1 + mod) % mod * qpow(x % mod, res) % mod;
    return res;
}
void solve() {
    long long x;
    cin >> x;
    cal_g(x);
    long long ans = 1;
    for (long long l = 1, r; l <= x; l = r + 1) {
        r = x / (x / l);
        long long now = cal_purfer(x / l) % mod;
        ans = (__int128)ans % mod * qpow(now, r - l + 1) % mod;
    }
    printf("%lld\n", (ans + mod) % mod);
}
int main() {
    int T = 1;
    // cin>>T;
    while (T--) {
        solve();
    }
    return 0;
}