#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

constexpr int N = 1E7 + 10, mod = 998244353;

i64 fac[N], invfac[N];

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

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);


	int n;
	cin >> n;
	fac[0] = invfac[0] = 1;
	for (i64 i = 1; i <= n; ++i) {
		fac[i] = (fac[i - 1] * i) % mod;
		invfac[i] = (invfac[i - 1] * qmi(i, mod - 2)) % mod;
	}
	// for (int i = 0; i <= 10; ++i) {
	// 	for (int j = 0; j <= i; ++j) {
	// 		cout << (fac[i] * invfac[j]) % mod << " ";
	// 	}
	// 	cout << "\n";
	// }
	i64 ans = 0;
	for (int i = 1; i <= n; ++i) {
		if (i - 1 > n - i) break;
		i64 t;
		if (i - 1 == 0) {
			t = fac[n - i];
		} else {
			t = ((fac[n - i] * invfac[n - 2 * i + 1] % mod) * (fac[n - i])) % mod;
		}
		ans = (ans + t) % mod;
	}
	cout << ans << "\n";
	return 0;
}