#include <vector>
#include <iostream>
using namespace std;
constexpr int M = 998244353;

bool is_prime(int x) {
    for (int i = 2; i * i <= x; i++)
        if (x % i == 0) return false;
    return true;
}

int main() {
    int n; cin >> n;
    vector<int> ps;
    bool b[n+1];
    fill(b, b+n+1, true);
    for (int i = 2; i <= n; i++)
        if (b[i]) {
            for (int j = i; j <= n; j += i) b[j] = false;
            ps.push_back(i);
        }
    ps.pop_back();
    vector<int> qs;
    long long ans = 1;
    for (int p : ps) {
        long long q = p;
        while (q * p <= n) q *= p;
        ans = ans * q % M;
    }
    cout << ans << endl;
}