#include<bits/stdc++.h>
using namespace std;

constexpr int mod = 998244353;
// #define int long long
inline int add(int x, int y) {
    return (x + y >= mod ? x + y - mod : x + y);
}
inline int mul(int x, int y) {
    return 1ll * x * y % mod;
}
int qpow(int x, long long n) {
    int y = 1;
    for (; n; n /= 2, x = mul(x, x)) if (n & 1) y = mul(y, x);
    return y;
}

namespace Min25 {
constexpr int maxs = 1000000;
int pri[maxs / 7], lpf[maxs + 1], pcnt;
const int inv2 = qpow(2, mod - 2);

void sieve(int n) {
    for (int i = 2; i <= n; i++) {
        if (!lpf[i]) {
            lpf[i] = ++pcnt;
            pri[lpf[i]] = i;
        }
        for (int j = 1, v; j <= lpf[i] && (v = i * pri[j]) <= n; j++) lpf[v] = j; 
    }
}
long long global_n;
int lim;
int le[maxs + 1], ge[maxs + 1];
#define idx(v) (v <= lim ? le[v] : ge[global_n / v])

long long G[maxs + 1];
long long lis[maxs + 1];
int cnt;

void initG(long long n) {
    for (long long i = 1, j, v; i <= n; i = n / j + 1) {
        j = n / i;
        v = j;
        lis[++cnt] = j;
        (j <= lim ? le[j] : ge[global_n / j]) = cnt;
        G[cnt] = v - 1;
    }
}
void calcFprime() {
    for (int k = 1; k <= pcnt; k++) {
        int p = pri[k];
        long long sqrp = 1ll * p * p;
        for (int i = 1; lis[i] >= sqrp; i++) {
            long long v = lis[i] / p;
            int id = idx(v);
            G[i] -= G[id] - (k - 1);
        }
    }
}
void init(long long n) {
    global_n = n;
    lim = sqrt(n);
    sieve(lim + 1000);
    initG(n);
    calcFprime();
}
long long get(long long n) {
    return G[idx(n)];
}
}
using Min25::get;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    long long n;
    cin >> n;

    Min25::init(n);

    int res = 1;
    for (long long l = 1, r; l <= n; l = r + 1) {
        r = n / (n / l);
        long long m = n / l;
        long long cnt = get(m) - get(m / 2);
        long long k = 1 + cnt + (m - cnt - 1 > 0);
        int ans = qpow(m % mod, k - 2);
        if (m - cnt - 1 > 0) {
            ans = mul(ans, (m - cnt - 1) % mod);
        }
        res = mul(res, qpow(ans, r - l + 1));
    }
    cout << res;


    return 0;
}