#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N =1e7+10;
const int mod=998244353;
ll f[N],inv[N];

void solve(){
    int n,ans=0;
    cin >> n;

    int tmp;
    for(int i=0;i<n;i++){
        if(i>n-i)continue;
        tmp=f[n-i-1]*inv[i]%mod*inv[n-2*i-1]%mod;
        ans+=(tmp%mod*f[i]%mod*f[n-i-1]%mod)%mod;
        ans %= mod;
    }
    cout << ans << endl;
}

int main(){
    f[0] = f[1] = inv[0] = inv[1] = 1;
    for(int i=2;i<=N;i++)f[i]=f[i-1]%mod*i%mod,inv[i]=(mod-mod/i)%mod*inv[mod%i]%mod;
    for(int i=1;i<=N;i++)inv[i]=inv[i-1]%mod*inv[i]%mod;
    ll _;
    _ = 1;
    // cin >> _;
    while (_--)
    {
        solve();
    }
}