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

using ll = long long;

bool chmin(auto &a, auto b) { return a > b ? a = b, true : false; }
bool chmax(auto &a, auto b) { return a < b ? a = b, true : false; }

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    vector<vector<int>> D(N);
    for (int i = 2; i < N; i++) {
        if (D[i].empty()) {
            for (int j = i; j < N; j += i) {
                D[j].push_back(i);
            }
        }
    }
    vector<int> P(N);
    for (int i = 1; i < N; i++) {
        map<int, int> cnt;
        for (int p : D[i]) {
            int a = i;
            while (a % p == 0) {
                a /= p;
                cnt[p]++;
            }
        }
        for (int p : D[N - i]) {
            int a = N - i;
            while (a % p == 0) {
                a /= p;
                cnt[p]++;
            }
        }
        for (auto [p, e] : cnt) {
            chmax(P[p], e);
        }
    }
    mint ans = 1;
    for (int i = 2; i < N; i++) {
        ans *= mint(i).pow(P[i]);
    }
    cout << ans.val() << endl;
}