#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define rrep(i,n) for(int i = int(n)-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
using namespace std;
using ll = long long;
using Pi = pair<int,int>;
using Pll = pair<ll,ll>;
template<class T> bool chmax(T &a, const T &b) {if(a < b) {a = b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b) {if(b < a) {a = b; return true;} return false;}
int dx[] = {1, 0,-1, 0, 1, 1,-1,-1};
int dy[] = {0, 1, 0,-1, 1,-1, 1,-1};
ll mod = 998244353;
ll MOD = 1000000007;
int inf = 1001001001;
ll INF = 1001001001001001001;
ll mod_pow(ll x,ll y,ll m) {
    ll res = 1;
    while(y > 0) {
        if(y%2) {
            res = res*x%m;
        }
        x = x*x%m;
        y /= 2;
    }
    return res;
}
int main() {
    int N;
    cin >> N;
    vector<bool>prime(1000005,1);
    prime[1] = 0;
    for(int i = 2; i <= N; i++) {
        if(!prime[i]) {
            continue;
        }
        for(int j = 2; i*j <= 1000000; j++) {
            prime[i*j] = 0;
        }
    }
    ll ans = 1;
    ll mx = 0;
    for(ll i = 1; i <= N; i++) {
        if(prime[i] == 1) {
            chmax(mx,i);
            ll tmp = i;
            while (tmp*i <= N) {
                tmp *= i;
            }
            tmp %= mod;
            ans *= tmp;
            ans %= mod;
        }
    }
    cout << ans*mod_pow(mx,mod-2,mod)%mod << endl;
}