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

const int N = 5000 + 5, P = 998244353;
int dp[N][N];
int n;
long long fac[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;
}

void init() {
	fac[0] = 1;
	for (int i = 1; i <= n; i++) {
		fac[i] = fac[i - 1] * i % P;
	}
}

long long C(int n, int m) {
	return fac[n] * qpow(fac[n - m], P - 2) % P * qpow(fac[m], P - 2) % P;
}

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

	scanf("%lld", &n);
	if (n == 3) {
		puts("1");
		return 0;
	}
	init();
	dp[0][0] = 1;
	dp[1][1] = 1;
	for (int i = 2; i < n; i++) {
		for (int j = 1; j <= n; j++) {
			dp[i][j] = dp[i - 1][j - 1];
			if (i == 2) {
				(dp[i][j] += dp[i - 2][j - 1]) %= P;
			}
			else {
				(dp[i][j] += (dp[i - 2][j - 1] + dp[i - 3][j - 1]) % P) %= P;
			}
		}
	}
	int ans = 2;
	for (int i = 1; i < n; i++) {
		ans = (ans + 1ll * (C(n - 1, i) - (dp[n - 1][i] + dp[n - 2][i] + dp[n - 3][i]) % P + P) % P * fac[i] % P * fac[n - i - 1] % P * qpow(fac[n - 1], P - 2) % P) % P;
	}
	printf("%lld\n", ans);

	return 0;
}