#include <bits/stdc++.h>
#define For(i,l,r) for(int i=l; i<=r; i++)
using namespace std;
typedef long long ll;
const int mo=998244353,N=1e7+5;
ll ksm(ll x,int y){
    ll ans=1;
    while(y){
        if (y&1) ans=ans*x%mo;
        x=x*x%mo; y>>=1;
    }
    return ans;
}
ll jc[N],ny[N];
ll c(int x,int y){
    return jc[x]*ny[x-y]%mo*ny[y]%mo;
}
ll nc(int x,int y){
    return ny[x]*jc[x-y]%mo*jc[y]%mo;
}
int main(){
    int n; cin>>n;
    int o=1e7;
    jc[0]=ny[0]=1;
    For(i,1,o) jc[i]=jc[i-1]*i%mo;
    ny[o]=ksm(jc[o],mo-2);
    for(int i=o-1;i>=1;--i) ny[i]=ny[i+1]*(i+1)%mo;
    ll ans=jc[n-1],s=jc[n-1];
    For(i,1,n/2) ans=(ans+s*c(n-i-1,i)%mo*nc(n-1,i))%mo; //cout<<ans<<endl;
    cout<<ans<<endl;
}