#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

const int MOD = 998244353;

int add(int a, int b) {
	return a + b >= MOD ? a + b - MOD : a + b;
}

int sub(int a, int b) {
	return a >= b ? a - b :  a + MOD - b;
}

int mul(int a, int b) {
	return (1ll * a * b) % MOD;
}

int pw(int x, int n) {
	int res = 1;
	while (n) {
		if (n % 2 == 0) {
			x = mul(x, x);
			n /= 2;
		} else {
			res = mul(res, x);
			--n;
		}
	}
	return res;
}

const int MAXN = 10'000'010;
int facts[MAXN];
int anti_facts[MAXN];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	facts[0] = 1;
	for (int i = 1; i < MAXN; ++i)
		facts[i] = mul(facts[i - 1], i);
	anti_facts[MAXN - 1] = pw(facts[MAXN - 1], MOD - 2);
	for (int i = MAXN - 2; i >= 0; --i)
		anti_facts[i] = mul(anti_facts[i + 1], i + 1);

	int n;
	cin >> n;
	int ans = 0;
	for (int x = 1; 2 * x <= n + 1; ++x) {
		ans = add(ans, mul(mul(facts[n - x], facts[n - x]), anti_facts[n - 2 * x + 1]));
	}
	cout << ans << '\n';
	return 0;
}