#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=998244353;
const int N=10000005;
ll ksm(ll x,ll n){
    ll res=1;x%=mod;
    while(n){
        if(n&1)res=res*x%mod;
        x=x*x%mod;n>>=1;
    }
    return res;
}
int n;
ll fac[N],ifac[N];
ll A(int n,int m){
    return fac[n]*ifac[n-m]%mod;
}
int main()
{
    cin>>n;
    fac[0]=ifac[0]=1;
    for(int i=1;i<=n;i++)
        fac[i]=fac[i-1]*i%mod;
    ifac[n]=ksm(fac[n],mod-2);
    for(int i=n-1;i>=1;i--)
        ifac[i]=ifac[i+1]*(i+1)%mod;
    ll ans=0;
    for(int i=(n+1)/2;i>=1;i--){
        (ans+=fac[n-i]*A(n-i,i-1)%mod)%=mod;
    }
    cout<<ans<<endl;
    return 0;
}