//qoj8635
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 5010;
const ll P = 998244353;
int n;
ll f[N];

ll qp(ll x, ll y){
	ll ans = 1;
	while(y){
		if(y & 1){
			ans = ans * x % P;
		}
		x = x * x % P;
		y >>= 1;
	}
	return ans;
}

int main(){
	scanf("%d", &n);
	for(int i = 1; i <= n; ++ i){
		ll tmp = 0;
		for(int j = 0; j <= i + 1; ++ j){
			tmp += f[max(0, j-2)] + f[max(0, i-j-1)];
		}
		f[i] = tmp * qp(i+2, P-2) % P + 1;
	}
	printf("%lld\n", (f[n-3] + 1) % P);
	return 0;
}