#pragma GCC optimize(2)
#include<cmath>
#include<iostream>
#define mod 998244353
#define ll long long
#define N 10000005
using namespace std;

ll fac[N],inv1[N],inv0[N];
ll inv(ll t)
{
	return t == 1 ? 1 : (mod - mod / t) * inv(mod % t) % mod;
}

void init()
{
	int n = N-3;
	fac[0] = 1;
	inv1[0] = 1;
	inv0[1] = 1;
	fac[1] = fac[0]% mod;
	inv1[1] = inv(1) * inv1[0] % mod;
	for (int i = 2;i <= n;++i)
	{
		fac[i] = fac[i - 1] * i % mod;
		inv0[i] = inv0[mod % i] * (mod - mod / i) % mod;
		inv1[i] = inv0[i] * inv1[i - 1] % mod;
	}
	inv1[n] = inv(fac[n]);
}
ll A(ll a, ll b)
{
	ll ret = 0;
	if (b >= a)
		return fac[a];
	return fac[a] * inv1[a - b] % mod;
}
int main()
{
	int n;
	ll ans = 0;
	cin >> n;
	init();
	
	for (int i = 0;i < n;++i)
	{
		if (n - 1 - i < i)
			break;
		else ans = (ans + A(n - 1 - i, i) * A(n - 1 - i, n - 1 - i) % mod) % mod;
	}
	cout << ans << "\n";
	return 0;
}