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

typedef long long ll;

const int N = 5005;
const int mod = 998244353;

ll n, sum = 1, ans = 1, C[N][N], dp[N][N], t[N];

inline ll qpow(ll a, ll b) {
	ll res = 1;
	while (b) {
		if (b & 1) {
			res = res * a % mod;
		}
		a = a * a % mod;
		b >>= 1;
	}
	return res;
}

inline ll inv(ll a) {
	return qpow(a, mod - 2);
}

int main() {
	#ifdef LOCAL
		assert(freopen("T1.in", "r", stdin));
		assert(freopen("T1.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	cin >> n;
	if (n == 3) {
		cout << "1\n";
		return 0;
	}
	--n;
	C[0][0] = 1;
	for (int i = 1; i <= n; ++i) {
		C[i][0] = 1;
		for (int j = 1; j <= i; ++j) {
			C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
		}
	}
	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];
			if (i > 1) {
				dp[i][j] = (dp[i][j] + dp[i - 2][j - 1]) % mod;
			}
			if (i > 2) {
				dp[i][j] = (dp[i][j] + dp[i - 3][j - 1]) % mod;
			}
		}
	}
	ans = 2;
	for (int i = 1; i <= n; ++i) {
		sum = sum * i % mod;
		t[i] = (dp[n][i] + dp[n - 1][i] + dp[n - 2][i]) % mod;
		t[i] = (C[n][i] - t[i] + mod) % mod;
		t[i] = (t[i] * sum) % mod;
	}
	sum = 1;
	for (int i = 1; i <= n; ++i) {
		sum = sum * (n - i + 1) % mod;
		ans = (ans + t[i] * inv(sum)) % mod;
	}
	cout << ans << "\n";
	return 0;
}