#include<iostream>
#include<cstring>
#include<vector>
#include<unordered_map>
using namespace std;
using LL = long long;

const int maxn = 1e6 + 5;
bool isPrime[maxn];
int primes[maxn], cnt;
void init(){
    isPrime[1] = 1;
    for(int i = 2; i < maxn; i++){
        if (!isPrime[i]) primes[++cnt] = i;
        for(int j = 1; i * primes[j] < maxn; j++){
            isPrime[i * primes[j]] = 1;
            if (i % primes[j] == 0) break;
        }
    }
} 

const int mod = 998244353;

int mul(int a, int b){
    return 1LL * a * b % mod;
}

int qpow(int a, LL b){
    int ans = 1;
    while(b){
        if (b & 1) ans = mul(ans, a);
        b >>= 1;
        a = mul(a, a);
    }
    return ans;
}

int id1[maxn], id2[maxn];
LL w[maxn];
LL g[maxn];
LL n;

int get(LL x){
    if (x < maxn) return id1[x];
    return id2[n / x];
}

int main(){

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    init();
    cin >> n;
    int m = 0;
    for(LL l = 1, r; l <= n; l = r + 1){
        LL val = n / l;
        w[++m] = val;
        r = n / val;
        if (val < maxn) id1[val] = m;
        else id2[n / val] = m;
        g[m] = val - 1;
    }

    for(int i = 1; 1LL * primes[i] * primes[i] <= n; i++){
        for(int j = 1; j <= m and 1LL * primes[i] * primes[i] <= w[j]; j++){
            g[j] = g[j] - (g[get(w[j] / primes[i])] - (i - 1));
        }
    }

    auto f = [&](LL m){
        if (m == 1) return 1;
        LL cnt = g[get(m)] - g[get(m / 2)];
        LL k = 1;
        k += cnt;
        if (m - cnt - 1 > 0) k += 1;
        int ans = qpow(m % mod, k - 2);
        if (m - cnt - 1 > 0) ans = mul(ans, (m - cnt - 1) % mod);
        return ans;
    };

    LL ans = 1;
    for(LL l = 1, r; l <= n; l = r + 1){
        r = n / (n / l);
        ans = mul(ans, qpow(f(n / l), r - l + 1));
    }
    cout << ans << '\n';

}