#include <cstdio>
#include <algorithm>
#include <cmath>

using namespace std;

const int max1 = 316227;
const int mod = 998244353;

long long n;

bool is_not_prime[max1 + 5];
int prime[max1 + 5], total;

void Get_Prime ()
{
    for ( int i = 2; i <= max1; i ++ )
    {
        if ( !is_not_prime[i] )
            prime[++total] = i;
        
        for ( int j = 1; j <= total && i * prime[j] <= max1; j ++ )
        {
            is_not_prime[i * prime[j]] = true;
            if ( !(i % prime[j]) )
                break;
        }
    }
    return;
}

long long w[max1 * 2 + 5], f[max1 * 2 + 5], cnt;
int id1[max1 + 5], id2[max1 + 5];

int Quick_Power ( int base, long long p )
{
    int res = 1;
    while ( p )
    {
        if ( p & 1 )
            res = 1LL * res * base % mod;
        p >>= 1;
        base = 1LL * base * base % mod;
    }
    return res;
}

int Calc ( long long m )
{
    if ( m == 1 || m == 2 )
        return 1;
    if ( m == 3 )
        return 3;
    
    int v1 = m <= max1 ? id1[m] : id2[n / m];
    int v2 = m / 2 <= max1 ? id1[m / 2] : id2[n / (m / 2)];

    long long c = f[v1] - f[v2];

    return 1LL * Quick_Power(m, c) * ((m - c - 1) % mod) % mod;
}

int main ()
{
    Get_Prime();
    scanf("%lld", &n);

    for ( long long L = 1, R; L <= n; L = R + 1 )
    {
        R = n / (n / L);

        w[++cnt] = n / L;
        f[cnt] = w[cnt] - 1;

        if ( w[cnt] <= max1 )
            id1[w[cnt]] = cnt;
        else
            id2[n / w[cnt]] = cnt;
    }

    for ( int i = 1; i <= total; i ++ )
    {
        if ( 1LL * prime[i] * prime[i] > n )
            break;
        
        for ( int j = 1; j <= cnt; j ++ )
        {
            if ( 1LL * prime[i] * prime[i] > w[j] )
                break;
            
            int v = w[j] / prime[i] <= max1 ? id1[w[j] / prime[i]] : id2[n / (w[j] / prime[i])];

            f[j] = f[j] - f[v] + i - 1;
        }
    }

    int ans = 1;
    for ( long long L = 1, R; L <= n; L = R + 1 )
    {
        R = n / (n / L);

        int val = Calc(n / L);
        ans = 1LL * ans * Quick_Power(val, R - L + 1) % mod;
    }

    printf("%d\n", ans);

    return 0;
}