#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int SIZE = 10000003;
const ll MD = 998244353;
ll jc[SIZE], jc_inv[SIZE];

ll pwer(ll a, ll b, ll ret = 1ll) {
	for ( ; b; b >>= 1) {
		if (b & 1) ret = ret * a % MD;
		a = a * a % MD;
	}
	return ret;
}

int main() {
	ll n;
	cin >> n;

	// cout << pwer(3, 3) << endl;

	jc[0] = 1;
	for (int i = 1; i <= n; i++) {
		jc[i] = jc[i - 1] * i % MD;
	}
	jc_inv[n] = pwer(jc[n], MD - 2);
	// assert(jc_inv[n] * jc[n] % MD == 1);
	for (int i = n - 1; i >= 0; i--) {
		jc_inv[i] = jc_inv[i + 1] * (i + 1) % MD;
	}
	// assert(jc_inv[0] == 1);

	ll lim = (n + 1) / 2;
	ll ans = 0;
	for (int i = 1; i <= lim; i++) {
		ll t = jc[n - i] * jc[n - i] % MD * jc_inv[n - i - i + 1] % MD;
		// cout << "i = " << i << ", " << t << endl;
		ans = (ans + t) % MD;
	}
	cout << ans;
}