#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e7 + 10;
const int mod = 998244353;

long long binpow(long long a, long long b) // 快速幂
{
	long long res = 1;
	while (b > 0)
	{
		if (b & 1)
			res = res * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return res;
}

ll pailie(ll x)
{
	ll ans = 1;
	for (ll i = 1; i <= x; i++)
	{
		ans *= i;
		ans %= mod;
	}
	return ans % mod;
}
ll zuhe(ll x, ll y)
{
	ll ans;
	ans = ((pailie(x) * binpow(pailie(x - y), mod - 2)) % mod * binpow(pailie(y), mod - 2)) % mod; // 费马定理 a/b%n =a *pow(b,n-2)%n;n为质数
	return ans % mod;
}

void solve()
{
	ll n, ans = 0;
	cin >> n;

	ll tmp;
	for (ll i = 0; i < n; i++)
	{
		if (i > n - i-1)
			continue;
		ans += (zuhe(n - i - 1, i) % mod * pailie(i) % mod * pailie(n - i - 1) % mod) % mod;
		ans %= mod;
	}
	cout << ans << endl;
}

int main()
{
	ll _;
	_ = 1;
	// cin >> _;
	while (_--)
	{
		solve();
	}
}