#include<bits/stdc++.h>
using namespace std;
const int N=5010,mod=998244353;
int dp[N][N],fac[N];
int qpow(int a,int b){
	int ans=1;
	while(b){
		if(b&1){
			ans=1ll*ans*a%mod;
		}
		a=1ll*a*a%mod;
		b>>=1;
	}
	return ans;
}
int main(){
	int n,ans=0;
	scanf("%d",&n);
	fac[0]=1;
	for(int i=1;i<=n;i++){
		fac[i]=1ll*fac[i-1]*i%mod;
	}
	dp[1][1]=1;
	for(int i=2;i<=n;i++){
		for(int j=1;j<=i;j++){
			dp[i][j]=(0ll+dp[i-1][j-1]+dp[i-2][j-1]+(i>=3)*dp[i-3][j-1])%mod;
		}
	}
	for(int i=1;i<=n;i++){
		dp[n][i]=(0ll+dp[n][i]+dp[n-1][i]+dp[n-2][i])%mod;
		dp[n][i]=1ll*dp[n][i]*fac[n-i]%mod*fac[i-1]%mod;
		ans=(ans+1ll*i*(dp[n][i]+mod-dp[n][i-1]))%mod;
	}
	printf("%lld",1ll*ans*qpow(fac[n-1],mod-2)%mod);
}