#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

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

int fac[N], invfac[N];

int qmi(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) {
			res = (1LL * res * a) % mod;
		}
		a = (1LL * 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 (int i = 1; i <= n; ++i) {
		fac[i] = (1LL * fac[i - 1] * i) % mod;
		// invfac[i] = (1LL * invfac[i - 1] * qmi(i, mod - 2)) % mod;
	}

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