#include <bits/stdc++.h>
#define _for(i, a, b)  for (int i = (a); i <= (b); i ++ )
#define ll long long
using namespace std;
const int N = 5005, P = 998244353;
int n; ll ans, g[N], fac[N], f[N][N];
inline void Add(ll & x, ll y) { (x += y % P) %= P; }
inline void Mul(ll & x, ll y) { (x *= y % P) %= P; }
inline ll pw(ll a, int b) {
	ll res = 1;
	while (b) {
		if (b & 1)  Mul(res, a);
		Mul(a, a), b >>= 1;
	}
	return res;
}
int main() {
	ios :: sync_with_stdio(false), cin.tie(0), cout.tie(0);
	cin >> n, n -- , fac[0] = fac[1] = f[0][0] = f[1][1] = f[1][2] = f[1][3] = 1;
	if (n == 2) { cout << "1\n"; return 0; }
	if (n == 3) { cout << "2\n"; return 0; }
	_for (i, 2, n) {
		fac[i] = fac[i - 1] * i % P;
		_for (j, i, min(n, 3 * i)) {
			f[i][j] = f[i - 1][j - 1];
			if (j > 2)  Add(f[i][j], f[i - 1][j - 2]);
			if (j > 3)  Add(f[i][j], f[i - 1][j - 3]);
		}
	}
	_for (i, 1, n) {
		g[i] = (f[i][n - 1] + f[i][n - 2] + f[i - 1][n - 1] + f[i - 1][n - 2] + f[i - 1][n - 3]) % P;
		Add(ans, (g[i] * fac[i] % P * fac[n - i] % P - g[i - 1] * fac[i - 1] % P * fac[n - i + 1] % P + P) % P * i % P);
	}
	cout << (ans * pw(fac[n], P - 2) % P + P + 1) % P << "\n";
	return 0;
}