#include <bits/stdc++.h>
using namespace std;

const int N = 5000 + 5, P = 998244353;
int dp[N], n;

long long qpow(long long a, int b) {
	long long ans = 1;
	while (b) {
		if (b & 1) {
			ans = ans * a % P;
		}
		a = a * a % P;
		b >>= 1;
	}
	return ans;
}

int main() {
	#ifndef ONLINE_JUDGE
	freopen("test.in", "r", stdin);
	freopen("test.out", "w", stdout);
	#endif

	scanf("%d", &n);
	dp[1] = 0;
	dp[2] = 0; 
	for (int i = 3; i <= n - 1; i++) {
		int sum = 0;
		for (int j = 1; j <= i; j++) {
			sum = (sum + (dp[j - 1] + dp[i - j]) % P) % P;
		}
		sum = 1ll * sum * qpow(i, P - 2) % P;
		dp[i] = sum + 1;
	}
	printf("%d", dp[n - 1] + 1);

	return 0;
}