#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 1e7+7,mod=998244353,INF=1e18;
ll fac[N],inv[N];
ll qk(ll a,ll b){
	ll ans=1;
	while(b){
		if(b&1) ans=ans*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return ans;
}
void init(){
	ll tot=1e7;
	fac[0]=1;
	for(ll i=1;i<=tot;i++) fac[i]=fac[i-1]*i%mod;
	inv[tot]=qk(fac[tot],mod-2);
	for(ll i=tot-1;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
}
ll C(ll n,ll m){
	if(m>n||m<0) return 0;
	return fac[n]*inv[n-m]%mod*inv[m]%mod;
}
void solve(){
	init();
	ll n,ans=0;
	cin>>n;
	for(ll i=1;i<=n;i++){
		ans=(ans+C(n-i,i-1)*fac[i-1]%mod*fac[n-i]%mod)%mod;
	}
	cout<<ans<<"\n";	
}
int main(){
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	
	ll T=1;
//    cin>>T;
    while(T--){
        solve();
    }
	return 0;
}