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

int main() {
    int n;
    cin >> n;

    vector<bool> prime(n + 1, true);
    for (int i = 2; i * i <= n; i++) {
        if (not prime.at(i)) continue;
        for (int j = i; i * j <= n; j++) {
            prime.at(i * j) = false;
        }
    }
    
    vector<int> primes;
    for (int i = 2; i <= n; i++) {
        if (not prime.at(i)) continue;
        int m = n;
        while (m >= i) {
            primes.push_back(i);
            m /= i;
        }
    }
    primes.pop_back();
    
    const int64_t mod = 998244353;
    int64_t ans = 1;
    for (int x : primes) {
        ans *= x;
        ans %= mod;
    }

    cout << ans << endl;
}