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

int main() {
    int N;
    cin >> N;
    vector<bool>prime(1000001,true);
    for(int i = 2; i <= 1000000; i++) {
        if(prime[i]) {
            for(int j = 2*i; j <= 1000000; j += i) {
                prime[j] = false;
            }
        }
    }
    long long tmp = 1;
    constexpr int mod = 998244353;
    for(int i = 2; i < N; i++) {
        if(!prime[i]) {
            continue;
        }
        int mx = 0;
        for(int j = 1; i*j < N; j++) {
            int x = i*j,y = 1;
            while (x%i == 0) {
                x /= i;
                y *= i;
            }
            x = N-i*j;
            while (x%i == 0) {
                x /= i;
                y *= i;
            }
            mx = max(mx,y);
        }
        tmp *= mx;
        tmp %= mod;
    }
    cout << tmp << endl;
}