#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
const ll MAX = 5000000000000000000;
ll MOD = 998244353;
ll modinv(ll A,ll M){
    A %= M;
    if(A == 0 || __gcd(A,M) != 1){
        //cout << "Error\nmodinv(" << A << "," << M << ")\n";
        return -1;
    }
    ll B = M,U = 1,V = 0;
    while(B){
        ll T = A / B;
        A -= T * B;
        swap(A,B);
        U -= T * V;
        swap(U,V);
    }
    U %= M;
    if(U < 0) U += M;
    return U;
}
ll modpow(ll A,ll B,ll M){
    ll r = 1,p = A;
    while(B > 0){
        if(B % 2 == 1) r = (r * p) % M;
        p = (p * p) % M;
        B /= 2;
    }
    return r;
}

int main(){
    ll N,i,j,ans = 1,a;
    cin >> N;
    vector<ll> O(2000000,-1),P(2000000,0),S(2000000,0);
    for(i = 2;i < 2000000;i++){
        P[i] = O[i];
        if(O[i] == -1){
            P[i] = i;
            for(j = i * 2;j < 2000000;j += i) O[j] = i;
        }
    }
    for(i = 1;i <= N;i++){
        map<ll,ll> M;
        a = i;
        while(a > 1){
            M[P[a]]++;
            S[P[a]] = max(S[P[a]],M[P[a]]);
            a = a / P[a];
        }
    }
    for(i = 2;i < 2000000;i++){
        ans = (ans * modpow(i,S[i],MOD)) % MOD;
    }
    for(i = N;i >= 0;i--){
        if(O[i] == -1){
            cout << (ans * modinv(i,MOD)) % MOD << endl;
            return 0;
        }
    }
}