#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n;
const int N = 1e7;
const int mod = 998244353;
ll g[N << 1];
int id(ll i){
    return i < N ? i : N + n / i;
}
int qp(int x, int k){
    int res = 1;
    while(k){
        if(k & 1) res = 1LL * res * x % mod;
        k >>= 1, x = 1LL * x * x % mod;
    }
    return res;
}
int tot;
int prime[N];
bool check[N];
void init(){
    for(int i = 2; i < N; i++){
        if(!check[i]) prime[++tot] = i;
        for(int j = 1; j <= tot; j++){
            if(i * prime[j] >= N) break;
            check[i * prime[j]] = 1;
            if(i % prime[j] == 0) break;
        }
    }
}
int cal(ll x){
    if(x <= 3) return x <= 2 ? 1 : 3; 
    ll cntp = g[id(x)] - g[id(x / 2)];
    return 1LL * (x - cntp - 1) % mod * qp(x % mod, cntp) % mod;
}
int main(){
    init();
    cin >> n;
    init();
    int ans = 1;
    for(ll i = n; i > 1; i = n / (n / i + 1)){
        g[id(i)] = i - 1;
    }
    for(int j = 1; 1LL * prime[j] * prime[j] <= n; j++){
        for(int i = n; i >= prime[j] * prime[j]; i = n / (n / i + 1)){
            g[id(i)] -= g[id(i / prime[j])] - g[id(prime[j - 1])];
        }
    }
    for(ll l = 1, r; l <= n; l = r + 1){
        r = n / (n / l);
        int res = cal(n / l);
        ans = 1LL * ans * qp(res, r - l + 1) % mod; 
    }
    cout<<ans;
}