#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

const int N = 1e7+10, MO = 998244353;

LL n, fac[N], facInv[N];

LL qpm(LL a, LL b) {
	LL ans = 1;
	while(b) {
		if(b & 1) ans = ans * a % MO;
		a = a * a % MO;
		b >>= 1;
	}
	return ans;
}
LL A(int n, int m) {
	if(m < 0) return 0;
	if(n < m) return 0;
	return fac[n] * facInv[n-m] % MO;
}
int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> n;
	fac[0] = 1;
	for(int i = 1; i <= n; i ++) fac[i] = fac[i-1] * i % MO;
	facInv[n] = qpm(fac[n], MO-2);
	for(int i = n-1; i >= 0; i --) facInv[i] = facInv[i+1] * (i+1) % MO;
	LL ans = 0;
	for(int i = 1; i <= n; i ++) {
		ans = (ans + A(n-i, i-1) * A(n-i, n-i) % MO) % MO;
	}
	cout << ans << '\n';
	return 0;
}