#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

struct osa_k {
    using _ll = long long;

    #define PRIME_FACTORIZE_MAX 2000010
    vector<_ll> primes;

    osa_k() {
        primes.resize((PRIME_FACTORIZE_MAX));
        for(_ll i = 0; i < PRIME_FACTORIZE_MAX; i++) {
            primes[i] = 1;
        }
        for(_ll i = 2; i < PRIME_FACTORIZE_MAX; i++) {
            if(primes[i] != 1) continue;
            for(_ll j = i; j <= PRIME_FACTORIZE_MAX; j += i) {
                primes[j] = i;
            }
        }
    }

    vector<pair<_ll,_ll>> factorize(_ll n){
        vector<pair<_ll,_ll>> res;
        while(n != 1) {
            _ll cur = primes[n];
            _ll cnt = 0;
            while(n % cur == 0) {
                n /= cur;
                cnt++;
            }
            res.push_back({cur, cnt});
        }
        reverse(res.begin(), res.end());
        return res;
    }
} osa_k;

vector<pair<long long, long long>>factorize(long long n) {
    return osa_k.factorize(n);
}

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

void solve() {
    ll n;
    cin >> n;
    map<ll,ll> mp;
    rep(i, 1, n) {
        auto u = factorize(i);
        auto v = factorize(n-i);
        map<ll,ll> w;
        for(auto [a, p] : u) w[a] += p;
        for(auto [a, p] : v) w[a] += p;
        for(auto [a, p] : w) mp[a] = max(mp[a], p);
    }    
    mint ans = 1;
    for(auto [a, p] : mp) ans *= mint(a).pow(p);
    cout << ans.val() << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}