#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

constexpr ll mod=998244353;

ll mod_pow(ll a,ll b){
    a%=mod;
    if(b==0)return 1;
    if(b==1)return a;
    ll res=mod_pow(a,b/2)%mod;
    res*=res; res%=mod;
    if(b%2)res*=a;
    return res%mod;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    const int N=2e6+1;
    vector<int> p,lp(N); // lp[i]:iの最小素因数
    lp[0]=lp[1]=-1;
    for(int i=2;i<lp.size();i++){
        if(lp[i]==0){
            lp[i]=i;
            p.emplace_back(i);
        }
        for(int j=0;j<p.size() and p[j]<=lp[i] and i*p[j]<=lp.size();j++){
            lp[i*p[j]]=p[j];
        }
    }
    int n; cin >> n;
    ll r=1;
    map<int,int> res;
    for(int i=1;i<=n/2;i++){
        int b=i,c=n-i;
        map<int,int> mp;
        while(b>1){
            mp[lp[b]]++;
            b/=lp[b];
        }
        swap(b,c);
        while(b>1){
            mp[lp[b]]++;
            b/=lp[b];
        }
        for(auto p:mp){
            res[p.first]=max(res[p.first],p.second);
        }
    }
    for(auto p:res){
        (r*=mod_pow(p.first,p.second))%=mod;
    }
    cout << r << endl;
}