#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=5010,mod=998244353;
int n;
ll jc[N],dp[N][N],f[N],ans;
ll mi(ll a,ll b){
	ll res=1;
	while(b){
		if(b&1)res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res;
}
void init(){
	ios::sync_with_stdio(0);
	cin.tie(nullptr);
	cin>>n;
	jc[0]=1;
	for(int i=1;i<=n;i++)jc[i]=jc[i-1]*i%mod;
}
int main(){
	init();
	if(n==3){
		cout<<1;
		return 0;
	}
	if(n==4){
		cout<<2;
		return 0;
	}
	n--;
	dp[1][1]=dp[1][2]=dp[1][3]=1;
	for(int i=2;i<=n-1;i++){
		for(int j=1;j<=n-1;j++){
			dp[i][j]=dp[i-1][j-1]+dp[i-1][j-2];
			if(j>=3)dp[i][j]+=dp[i-1][j-3];
			dp[i][j]%=mod;
		}
	}
	for(int i=1;i<=n;i++){
		f[i]=dp[i][n-1]+dp[i][n-2]+dp[i-1][n-1]+dp[i-1][n-2]+dp[i-1][n-3];
		f[i]%=mod;
	}
	ans=0;
	for(int i=1;i<=n;i++){
		ans+=(f[i]*jc[i]%mod*jc[n-i]%mod+mod-f[i-1]*jc[i-1]%mod*jc[n-(i-1)]%mod)*i%mod;
		ans%=mod;
	}
	ans=ans*mi(jc[n],mod-2)%mod;
	cout<<(ans+1)%mod;
	return 0;
}