#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=5100,mod=998244353;
int n,fac[N],ifac[N],dp[N][N],ans=0;
int poww(int a,int b){
	int ret=1;
	while(b){
		if(b&1) ret=ret*a%mod;
		b>>=1,a=a*a%mod;
	}
	return ret;
}
int inv(int a){return poww(a,mod-2);}
void init(){
	n=5e3;
	fac[0]=1;
	for(int i=1;i<=n;i++) fac[i]=fac[i-1]*i%mod;
	ifac[n]=inv(fac[n]);
	for(int i=n-1;i>=0;i--) ifac[i]=ifac[i+1]*(i+1)%mod;
}
int invC(int n,int m){return ifac[n]*fac[m]%mod*fac[n-m]%mod;}
signed main(){
	init();
	cin>>n;
	if(n==3){cout<<"1\n";return 0;}
	dp[0][0]=1;
	for(int i=1;i<n;i++) for(int j=1;j<n;j++) dp[i][j]=(dp[i-1][j-1]+dp[i-1][j-2]+dp[i-1][j-3])%mod;
	for(int i=1;i<n;i++) ans=(ans+1-(dp[i][n-1]+dp[i][n-2]+dp[i][n-3])*invC(n-1,i)%mod+mod)%mod;
	cout<<ans+2<<'\n';
	return 0;
}