#include <bits/stdc++.h>
#define mod 998244353
using namespace std;

const int N = 1e7 + 10;
using ll = long long ;

ll mul[N], inv[N];

ll qpow(ll x, ll n) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % mod;
		x = x * x % mod;
		n >>= 1;
	}
	return res;
}

void prework() {
	mul[0] = 1;
	for (int i = 1; i < N; i++) {
		mul[i] = mul[i - 1] * i % mod;
	}
	
	inv[N - 1] = qpow(mul[N - 1], mod - 2);
	for (int i = N - 2; i >= 0; i--) {
		inv[i] = inv[i + 1] * (i + 1) % mod;
	}
}

void qwq()
{
	ll ans = 0;
	int n;
	cin >> n;
	
	for (int i = 1; i <= n; i++) {
		if (i - 1 <= n - i) {
			ans += mul[n - i] * mul[n - i] % mod * inv[n - i * 2 + 1] % mod;
			ans %= mod;
		}
	}
	
	cout << ans;
}

signed main()
{
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	prework();
	qwq();
	return 0;
}