/*******************************
| Author:  DE_aemmprty
| Problem: Graph
| Contest: Virtual Judge - QOJ
| URL:     https://vjudge.net/problem/QOJ-9309
| When:    2024-10-05 00:02:28
| 
| Memory:  1014 MB
| Time:    3000 ms
*******************************/
#include <bits/stdc++.h>
using namespace std;

long long read() {
    char c = getchar();
    long long x = 0, p = 1;
    while ((c < '0' || c > '9') && c != '-') c = getchar();
    if (c == '-') p = -1, c = getchar();
    while (c >= '0' && c <= '9')
        x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
    return x * p;
}

const int N = 1e6 + 7, Q = 1e6;
const long long mod = 998244353;

long long n, g[N * 2];
bool vis[N];
vector <long long> prime;

long long ksm(long long x, long long y) {
    long long res = 1; x %= mod;
    for (; y; y >>= 1, (x *= x) %= mod)
        if (y & 1)
            (res *= x) %= mod;
    return res;
}

long long getID(long long x) { return x <= Q ? x : Q + n / x;}

void calcG() {
    for (long long i = 1; prime[i] * prime[i] <= n; i ++)
        for (long long j = n; j >= prime[i] * prime[i]; j = n / (n / j + 1))
            g[getID(j)] -= g[getID(j / prime[i])] - g[prime[i - 1]];
}

long long f(long long x) {
    if (x == 1) return 1;
    if (x == 2) return 1;
    if (x == 3) return 3;
    long long num = g[getID(x)] - g[getID(x >> 1)] + 2;
    // printf("%d - %d's prime : %lld\n", x / 2 + 1, x, num - 2);
    return (x - num + 1) % mod * ksm(x, num - 2) % mod;
}

void solve() {
    n = read();
    prime.push_back(1);
    for (long long i = 2; i <= Q; i ++) {
        if (!vis[i]) {
            prime.push_back(i);
            for (long long j = i * i; j <= Q; j += i)
                g[j] = 1, vis[j] = 1;
        }
    }
    for (long long i = n; i > 1; i = n / (n / i + 1))
        g[getID(i)] = i - 1;
    calcG();
    long long ans = 1;
    long long l = 1;
    while (l <= n) {
        long long r = n / (n / l);
        (ans *= ksm(f(n / l), r - l + 1)) %= mod;
        l = r + 1;
    }
    cout << ans;
}

signed main() {
    int t = 1;
    while (t --) solve();
    return 0;
}