#include<bits/stdc++.h>
using u64 = unsigned long long;
using std::cin;
using std::cout;
const int mod = 998244353;
const int N = 1e7 + 10;
int fac[N];
int inv[N];
int ifac[N];
int comb(int n, int m) {
	if(m > n) return 0;
	return (u64) fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
#ifdef zqj
	// freopen("$.in", "r", stdin);
#endif
	int n;
	cin >> n;
	fac[0] = 1;
	ifac[0] = fac[1] = ifac[1] = inv[1] = 1;
	for(int i = 2;i <= n;++i) {
		inv[i] = u64(mod - mod / i) * inv[mod % i] % mod;
		ifac[i] = (u64) ifac[i - 1] * inv[i] % mod;
		fac[i] = (u64) fac[i - 1] * i % mod;
	}
	int ans = 0;
	for(int i = 1;i <= n;++i) {
		ans = (ans + (u64) comb(n - i, i - 1) * fac[i - 1] % mod * fac[n - i]) % mod;
	}
	cout << ans << '\n';
}