#include <iostream>

using namespace std;

const int mod=998244353;

int pre[10000001],inv[10000001];

inline int quick_pow(int base,int index)
{
	long long ans=1,tmp=base;
	
	while(index){
		if(index&1){
			ans*=tmp;
			ans%=mod;
		}
		tmp*=tmp;
		tmp%=mod;
		index>>=1;
	}
	
	return ans;
}

int get_inv(int x)
{
	return quick_pow(x,mod-2);
}

int get_CC(int down,int up)
{
	return 1ll*pre[down]*inv[down-up]%mod;
}

signed main()
{
	int n;
	cin>>n;
	
	pre[0]=inv[0]=1;
	for(int i=1;i<=n;i++){
		pre[i]=1ll*pre[i-1]*i%mod;
		inv[i]=1ll*inv[i-1]*get_inv(i)%mod;
	}
	
	int ans=0;
	for(int i=1;i<=(n+1)/2;i++){
		ans+=1ll*pre[n-i]*get_CC(n-i,i-1)%mod;
		ans%=mod;
	}
	
	cout<<ans;
	
	return 0;
}