#include<bits/stdc++.h>
using namespace std;
const int N=1e7,mod=998244353;
int fac[N+5],ifac[N+5],n;
int ksm(int x,int y){
    int res=1;
    while (y){
        if (y&1) res=1ll*res*x%mod;
        x=1ll*x*x%mod;
        y>>=1;
    }
    return res;
}
int binom(int n,int m){return 1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;}
int main(){
    scanf("%d",&n);
    fac[0]=1;
    for (int i=1;i<=N;++i) fac[i]=1ll*fac[i-1]*i%mod;
    ifac[N]=ksm(fac[N],mod-2);
    for (int i=N;i>=1;--i) ifac[i-1]=1ll*ifac[i]*i%mod;
    int ans=0;
    for (int i=1;i<=n;++i)
        if (n-i>=i-1){
            int t=1ll*binom(n-i,i-1)*fac[i-1]%mod*fac[n-i]%mod;
            ans=(1ll*ans+1ll*t)%mod;
        }
    printf("%d\n",ans);
    return 0;
}