#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod=998244353;

int fac[10000010],inv[100000010];

int ksm(int a,int b,int p){
    int res=1;
    while(b){
        if(b&1)res=res*a%p;
        a=a*a%p;
        b>>=1;
    }
    return res;
}

void solve()
{
    int n;
    cin>>n;
    fac[0]=1;
    for (int i=1;i<=n;i++){
        fac[i]=fac[i-1]*i%mod;
    }
    inv[n]=ksm(fac[n],mod-2,mod);
    for (int i=n-1;i>=0;i--){
        inv[i]=inv[i+1]*(i+1)%mod;
    }
    int res=0;
    for(int i=1;i<=(n+1)/2;++i){
        (res+=fac[n-i]*fac[n-i]%mod*inv[n-2*i+1]%mod)%=mod;
    }
    cout<<res<<endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int t=1;
    while(t--){
        solve();
    }
}