#include <bits/stdc++.h>
#define int long long
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 1e6 + 5, _ = 1e6, B = 1e6;
ll n, cnt, prime[N], pre[N];
bool vis[N];
void init(){
    _rep(i, 2, _){
        pre[i] = pre[i - 1];
        if(!vis[i]) prime[++cnt] = i, pre[i]++;
        for(int j = 1; j <= cnt && prime[j] * i <= _; ++j){
            vis[i * prime[j]] = 1;
            if(i % prime[j] == 0) break;
        }
    }
}
ll m, w[N], g[N], id1[N], id2[N];
ll kkk;
ll S(ll m){
    return m <= _ ? g[id1[m]] : g[id2[n / m]];
}
ll calc(ll l, ll r){return S(r) - S(l - 1);}
ll f(ll m){
    kkk++;
    if(m == 1) return 1;
    ll t = calc(m / 2 + 1, m) + 1;
    if(t == m) return t == 1 ? 1 : ksm(m, t - 2);
    return (m - t) % mod * ksm(m, t - 1) % mod;
}
signed main(){
    init();
    read(n);
    for(ll l = 1, r = 0; l <= n; l = r + 1){
        r = n / (n / l);
        w[++m] = n / l;
        g[m] = (w[m] - 1);
        if(w[m] <= _) id1[w[m]] = m;
        else id2[n / w[m]] = m;
    }
    // debug("eee\n");
    _rep(i, 1, cnt){
        if(prime[i] * prime[i] > n) break;
        for(int j = 1; j <= m && prime[i] * prime[i] <= w[j]; ++j){
            int k = (w[j] / prime[i] <= _) ? id1[w[j] / prime[i]] : id2[n / (w[j] / prime[i])];
            g[j] += 1ll * (i - 1) - g[k];
        }
    }
    // debug("fff\n");
    ll ans = 1;
    for(ll l = 1, r = 0; l <= n; l = r + 1){
        r = n / (n / l);
        mul(ans, ksm(f(n / l), r - l + 1) % mod);
    }
    writeln(ans);
    return 0;
}