#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=11000000;
const double eps=1e-5;
const int mod=998244353;
#define endl '\n'

ll ksm(ll a,ll b,ll p=mod){
    ll res=1;
    for(;b;b>>=1,a=a*a%p){
        if(b&1)res=a*res%p;
    }
    return res;
}

ll fac[N],infac[N];
void init(){
    fac[0]=fac[1]=1;
    for(int i=2;i<=10000000;i++)fac[i]=fac[i-1]*i%mod;
    infac[10000000]=ksm(fac[10000000],mod-2);
    for(int i=10000000;i>=1;i--)infac[i-1]=infac[i]*i%mod;
}
int main(){
    #ifdef LOCAL
    freopen("input.in","r",stdin);
    freopen("output.out","w",stdout);
    #endif
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int n;
    init();
    cin>>n;
    ll ans=0;
    for(int i=1;i<=n;i++){
        if(n-i<i-1){
            // ans=ans+fac[n-1];
            // if(ans>=mod)ans%=mod;
        }
        else{
            ans=ans+((fac[n-i]*fac[n-1-(i-1)]%mod*infac[n-i-(i-1)])%mod+mod);
            if(ans>=mod)ans%=mod;
        }
    }
    cout<<ans<<endl;

}