#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> Pr;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
#define mid ((l+r)>>1)
#define popcnt __builtin_popcountll
const ll mod = 998244353;
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
inline ll qpow(ll a,ll b){
	ll ans=1, base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod; b>>=1;
	}
	return ans;
}
void init(){ }
ll n,f[4][5005][5005];

void procedure(){
	n=read();
	f[1][1][1]=1; f[2][2][1]=1; f[3][3][1]=1;
	for(ll p=1;p<=3;p++)
	for(ll i=p+1;i<=n;i++){
		for(ll j=2;j<=i;j++){
			f[p][i][j]=(f[p][i-1][j-1]+f[p][i-2][j-1])%mod;
			if(i>3) f[p][i][j]=(f[p][i][j]+f[p][i-3][j-1])%mod;
		}
	}
	ll ans=1, now=1;
	for(ll k=1;k<=n;k++){
		ll coef=(f[1][n][k]+f[1][n-1][k]+f[1][n-2][k]+f[2][n][k]+f[2][n-1][k]+f[3][n][k])%mod;
		// cout<<"choose "<<k<<" full: "<<coef<<endl;
		now=now*(n-k+1)%mod*qpow(k,mod-2)%mod;
		ans=(ans+(now+mod-coef)*qpow(now,mod-2))%mod;
	}
	printf("%lld\n", ans);
}
int main(){
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	ll T=1;
	init();
	while(T--) procedure();
	return 0;
}