#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

const ll modc = 998244353;
vector<ll> spf;
map<ll, ll> prime;
map<ll, ll> pmax;

void osa_k(ll n){
    spf.resize(n+1);
    for (ll i=0; i<=n; i++) spf[i] = i;
    for (ll i=2; i*i<=n; i++){
        if (spf[i] == i){
            for (ll j=2; i*j <= n; j++){
                spf[i*j] = min(spf[i*j], i);
            }
        }
    }
}

void prime_factor(ll n){
    while(n != 1){
        prime[spf[n]]++;
        n /= spf[n];
    }
}

ll mod_exp(ll b, ll e, ll m){
    if (e > 0 && b == 0) return 0;
    ll ans = 1;
    b %= m;

    while (e > 0){
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b*b) % m;
    }

    return ans;
}

int main(){

    ll N, ans=1;
    cin >> N;
    osa_k(N);

    for (ll i=1; i<=N/2; i++){
        prime_factor(i);
        prime_factor(N-i);
        for (auto [x, y] : prime){
            if (!pmax.count(x)) pmax[x] = y;
            else pmax[x] = max(pmax[x], y);
        }
        prime.clear();
    }

    for (auto [x, y] : pmax){
        ans *= mod_exp(x, y, modc);
        ans %= modc;
    }

    cout << ans << endl;

    return 0;
}