#include <iostream>
#include <vector>
#include <map>

using namespace std;
using ll=long long;

vector<pair<ll,ll>> Prime_Factorization(ll N) {
    vector<pair<ll,ll>> R;
    ll e=0;
    
    while (N%2==0){
        e++;
        N/=2;
    }
    R.push_back({2,e});
    
    e=0;
    while (N%3==0){
        e++;
        N/=3;
    }
    R.push_back({3,e});
    
    ll p=5,f=0;
    while (p*p<=N) {
        if (N % p==0){
            ll e=0;
            while (N % p == 0){
                e++;
                N/=p;
            }
    
            R.push_back({p,e});
        }
        
        p+=2+2*f;
        f^=1;
    }

    if (N != 1) R.push_back({N, 1});
    
    return R;
}

ll pow_mod(ll a,ll p,ll m){
    ll x=1;
    while (p){
        if (p&1){
            x*=a;
            x%=m;
        }
        a*=a; a%=m;
        p>>=1;
    }
    return x;
}

ll max(ll a, ll b){
    if (a>b) return a;
    else return b;
}

int main(){
    ll N;
    ll mod=998244353;
    vector<pair<ll,ll>> R;
    map <ll,ll> D;
    cin >> N;

    for (int i=1; 2*i<=(N+1); i++){
        R=Prime_Factorization(i*(N-i));
        for (auto x:R) D[x.first]=max(D[x.first],x.second);
    }
    
    ll a=1;
    for (auto x:D){
        a*=pow_mod(x.first,x.second,mod);
        a%=mod;
    }

    cout << a << endl;
}