#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;

ll INF = 1e16;
int inf = 1e9;

#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (ll i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (ll i = ((n) - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll

// inputs
#define VLLIN(x, n) vll x(n); REP(i, n) cin >> x[i];
#define VIIN(x, n) vi x(n); REP(i, n) cin >> x[i];
#define VLDIN(x, n) vld x(n); REP(i, n) cin >> x[i];
#define SIN(s, n) string s; cin >> s;

#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...)  cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif

void d_err() {
    cerr << endl;
}

template <typename H, typename... T>
void d_err(H h, T... t) {
    cerr << h << " ";
    d_err(t...);
}

template <typename T>
void print(T x) {
    cout << x << "\n";
}

template <typename T>
void print(vector<T>& x) {
    int N = x.size();
    REP(i, N) {
        if (i > 0) cout << " ";
        cout << x[i];
    }
    cout << "\n";
}

// return primes between [2, n]
void SOE(ll n, vll& p) {
    vll s(n + 5);
    REP(i, s.size()) s[i] = i;

    p.eb(2);
    for (ll j = 4; j <= n; j += 2) {
        s[j] = 2;
    }

    for (ll i = 3; i <= n; i += 2){
        if (s[i] != i) continue;
        p.pb(i);
        for (ll j = i+i; j <= n; j += i) {
            s[j] = i;
        }
    }
}

//const ll MOD = 1000000007;
const ll MOD = 998244353;
struct mint {
    ll x; // typedef long long ll;
    mint(ll x=0):x((x%MOD+MOD)%MOD){}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += MOD-a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint operator+(const mint a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = 1;
        mint tmp = *this;
        while(t > 0) {
            if (t & 1) a *= tmp;
            tmp *= tmp;
            t >>= 1;
        }

        return a;
    }
    // for prime MOD
    mint inv() const {
        return pow(MOD-2);
    }
    mint& operator/=(const mint a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint a) const {
        return mint(*this) /= a;
    }
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}

typedef vector<mint> vmi;
#define VMIIN(x, n) vmi x(n); REP(i, n) cin >> x[i];

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    ll n; cin >> n;

    vll prime;
    SOE(sqrt(n) + 10, prime);

    debug(prime.size())

    vi cnt(prime.size(), 0);
    map<int, int> m;
    FOR(i, 1, n) {
        int a = i;
        int b = n - i;

        if (b < a) break;

        REP(j, prime.size()) {
            auto &p = prime[j];
            if (p > a && p > b) break;

            int c = 0;
            while(a % p == 0) {
                c++;
                a /= p;
            }

            while(b % p == 0) {
                c++;
                b /= p;
            }

            if (c == 0) continue;

            cnt[j] = max(cnt[j], c);
        }

        if (a == 1 && b == 1) continue;

        if (a == b) {
            m[a] = max(m[a], 2);
        } else {
            if (a != 1) m[a] = max(m[a], 1);
            if (b != 1) m[b] = max(m[b], 1);
        }
    }

    mint ans = 1;
    for (auto &e: m) {
        ans *= mint(e.fi).pow(e.se);
    }

    REP(i, prime.size()) {
        ans *= mint(prime[i]).pow(cnt[i]);
    }

    print(ans);
    
}