#define mod 998244353
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5005;
const int lim = maxn - 1;
ll fac[maxn], inv[maxn];
int n, sum[maxn];

inline ll qpow(ll x, ll y) {
	ll ans = 1, base = x;
	while(y) {
		if(y & 1) {
			ans = ans * base % mod;
		}
		y >>= 1;
		base = base * base % mod;
	}
	return ans;
}
inline void init() {
	fac[0] = 1;
	for(int i = 1; i <= lim; ++i) {
		fac[i] = fac[i - 1] * i % mod;
	}
	for(int i = 0; i <= lim; ++i) {
		inv[i] = qpow(fac[i], mod - 2);
	}
}
inline ll C(int x, int y) {
	if(x < y) {
		return 0;
	}
	return fac[x] * inv[y] % mod * inv[x - y] % mod;
}
int main() {
	ios::sync_with_stdio(false);
	init();
	cin >> n;
	assert(n >= 3);
	if(n == 3) {
		cout << 1 << endl;
		return 0;
	}
	for(int k = 1; k <= n - 1; ++k) {
		ll g = 0;
		for(int len = n - 3; len <= n - 1; ++len) {
			for(int a = 0; a <= k; ++a) {
				int b2c = len - k;
				int bc = k - a;
				int c = b2c - bc;
				int b = k - a - c;
				if(a >= 0 && b >= 0 && c >= 0) {
					g = (g + C(k, a) * C(k - a, b) % mod * fac[k] % mod) % mod;
					//cout<<k<<" "<<a<<" "<<b<<" "<<c<<"\n";
				}
			}
		}
		sum[k + 1] = g * fac[n - k - 1] % mod;
	}
//	 for(int k = 1; k <= n; ++k) {
//	 	   cout << sum[k] << ' ';
//	 } cout << endl;
	ll ans = 0;
	for(int k = 1; k <= n; ++k) {
		ll pdf = (sum[k] - sum[k - 1]) % mod * inv[n - 1] % mod;
		ans = (ans + pdf * k % mod) % mod;
	}
	ans = (ans % mod + mod) % mod;
	cout << ans << endl;
	return 0;
}

// a + b + c = k
// a + 2b + 3c = len
// C(k, a) * C(k - a, b)