#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
//#define MOD 1000000007
#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
#define PI acos(-1.0)

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
//using mint = modint998244353;

int dh[] = {-1,0,1,0};
int dw[] = {0,1,0,-1};


ll modpow(ll a, ll n, ll m){
    if(n == 0) return 1;
    ll half = modpow(a,n/2,m);
    ll res = half * half % m;
    if(n & 1) res = res * (a%m) % m;
    return res;
}

int main(){
    int n; cin >> n;
    vector<bool> used(n+1,false);
    vector<vector<Pi>> cnt(n+1);

    for(ll i = 2; i <= n; i++){
        if(used[i]) continue;
        for(int j = i; j <= n; j += i){
            used[j] = true;
            int k = j;
            int cnt2 = 0;
            while(k%i==0){
                cnt2++;
                k /= i;
            }
            cnt[j].push_back({i,cnt2});
        }
    }

    ll ans = 1;
    vector<int> cnt3(n+1);
    for(int i = 1; i <= n-i; i++){
        map<int,int> cnt4;
        for(auto [u,v] : cnt[i]) cnt4[u] += v;
        for(auto [u,v] : cnt[n-i]) cnt4[u] += v;
        for(auto [u,v] : cnt4){
            if(cnt3[u] < v){
                ans *= modpow(u,v-cnt3[u],MOD);
                ans %= MOD;
                cnt3[u] = v;
            }
        }
    }
    cout << ans << endl;
}