//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll mod=998244353;
ll ksm(ll a,ll b)
{
	ll ans=1;
	while(b)
	{
		if(b&1) ans=ans*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return ans;
}
ll C[5005][5005];
ll dp[5005][5005];
void upd(ll &a,ll b){a=(a+b)%mod;}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	for(int i=0;i<5005;i++)
		C[i][i]=C[i][0]=1;
	for(int i=2;i<5005;i++)
		for(int j=1;j<i;j++)
			C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
	int n;
	cin>>n;
	if(n<=3) die("1");
	dp[1][1]=1;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=i;j++)
		{
			upd(dp[i+1][j+1],dp[i][j]);
			upd(dp[i+2][j+1],dp[i][j]);
			upd(dp[i+3][j+1],dp[i][j]);
		}
	ll ans=0;
	for(int i=1;i<=n;i++)
	{
		ll tot=0;
		upd(tot,dp[n][i]);
		upd(tot,dp[n-1][i]);
		upd(tot,dp[n-2][i]);
		ll Tot=C[n-1][i-1];
		upd(ans,(Tot-tot+mod)*ksm(Tot,mod-2));
	}
	cout<<(ans+1)%mod<<endl;
	return 0;
}