#include <bits/stdc++.h>

using namespace std;
using ll = long long;

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

int n;
ll fac[N], inv[N], sum[N];

void add(ll &x, ll y) {
	x = x + y >= mod ? x + y - mod : x + y;
}

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

ll C(int x, int y) {
	if (x < y) return 0ll;
	return fac[x] * inv[y] % mod * inv[x - y] % mod;
}

signed main() {
//	freopen("color.in", "r", stdin);
//	freopen("color.out", "w", stdout);
	
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	cin >> n;
	if (n == 3) {
		cout << 1;
		return 0;
	}
	// define the first step is on the first.
	fac[0] = inv[0] = 1;
	for (int i = 1; i <= n; ++i) {
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = qpow(fac[i], mod - 2);
	}
	for (int k = 1; k < n; ++k) {
		// calc the answer less than k yet the first one.
		ll g = 0;
		for (int ed = n - 2; ed <= n; ++ed) {
			int len = ed - 1;
			for (int a = 0; a <= len && a <= k; ++a) {
				int b2c = len - k;
				int bc = k - a;
				int c = b2c - bc;
				int b = k - a - c;
				if (b >= 0 && c >= 0) {
					g = (g + C(k, a) * C(k - a, b) % mod * fac[k] % mod) % mod;
				}
			}
		}
		sum[k + 1] = g * fac[n - k - 1] % mod;
	}
	ll ans = 0;
	for (int i = 1; i <= n; ++i) {
//		cout << i << " : " << sum[i] - sum[i - 1] << '\n';
		ll tmp = (sum[i] - sum[i - 1] + mod) * inv[n - 1] % mod;
//		cout << tmp << " ON EARTH.\n";
		ans = (ans + tmp * i % mod) % mod;
	}
	cout << ans;
	
	return 0;
}