#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0),cin.tie(0)
#define int long long

using namespace std;

const int N=1e7+10;

int inv[N];
int fc[N],fc_inv[N];

void init_tot(int n,int mod) {
	inv[1]=fc[0]=fc[1]=fc_inv[0]=fc_inv[1]=1;
	for(int i=2; i<=n; i++) {
		inv[i]=(mod-mod/i)*inv[mod%i]%mod;
		fc[i]=fc[i-1]*i%mod;
		fc_inv[i]=inv[i]*fc_inv[i-1]%mod;
	}
}

signed main(){
	ios;
	int n;
	cin>>n;
	int mod=998244353;
	init_tot(n+1,mod);
	int res=0;
	auto C=[&](int m,int n){
		return 1ll*fc[m]*fc_inv[n]%mod*fc_inv[m-n]%mod;
	};
	for(int x=1;x<=n;x++){
		if(x-1>n-x)break;
//		cout<<x<<"\n";
		
		res=(res+1ll*C(n-x,x-1)*fc[n-x]%mod*fc[x-1]%mod)%mod;
//		res=(res+C(n-x,x-1)*fc[n-x]);
	}
		
	cout<<res<<"\n";
}