#include <bits/stdc++.h>
#define int long long
using namespace std;
int len, lim, lenp, a[7000000], g[7000000];
const int MOD = 998244353;
const int N = 1e7 + 3;
bitset<N> v;
int p[N >> 2], sum[N];
map<int, int> mp;
void seive()
{
    int cnt = 0;
    for (int i = 2; i < N; i++)
    {
        if (!v[i])
            p[cnt++] = i;
        for (int j = 0; j < cnt && i * p[j] < N; j++)
        {
            v[i * p[j]] = 1;
            if (i % p[j] == 0)
                break;
        }
    }
}
int fp(int x, int k)
{
    if (!k)
        return 1;
    if (k & 1)
        return x * fp(x, k - 1) % MOD;
    int tmp = fp(x, k >> 1);
    return tmp * tmp % MOD;
}
inline int get_index(int n, int x)
{
    if (x <= lim)
        return x;
    else
        return len - n / x + 1;
}
int cnt(int n)
{
    if (n < N)
        return sum[n];
    if (mp.count(n))
        return mp[n];
    lim = sqrt(n);
    len = lenp = 0;
    for (int i = 1; i <= n; i = a[len] + 1)
    {
        a[++len] = n / (n / i);
        g[len] = a[len] - 1;
    }
    for (int i = 2; i <= lim; ++i)
    {
        if (g[i] != g[i - 1])
        {
            ++lenp;
            for (int j = len; a[j] >= 1ll * i * i; --j)
                g[j] = g[j] - g[get_index(n, a[j] / i)] + lenp - 1;
        }
    }
    mp[n] = g[len];
    return g[len];
}
int f(int n)
{
    return cnt(n) - cnt(n / 2);
}
int F(int n)
{
    if (n <= 2)
        return 1;
    if (n == 3)
        return 3;
    int tmp = f(n);
    return fp(n % MOD, tmp) * (n % MOD - tmp % MOD - 1 + MOD) % MOD;
}
signed main()
{
    seive();
    for (int i = 2; i < N; i++)
        sum[i] = sum[i - 1] + !v[i];
    int n;
    cin >> n;
    int ans = 1;
    for (int l = 1, r; l <= n; l = r + 1)
    {
        r = n / (n / l);
        ans = ans * fp(F(n / l), r - l + 1) % MOD;
    }
    cout << ans;
}