#include <bits/stdc++.h>
using namespace std;
#define int unsigned long long
const int mod = 998244353;
signed main()
{
	int n;
	cin >> n;
	int zhong = (n + 1) / 2;
	int ans = 1;
	for (int i = 1; i <= zhong; i++)
	{
		ans = (ans * i) % mod;
	}
	int jc = ans;
	int shu = 1;
	int cha = n - zhong-1;
	int a = 0, b = 0;
	for (int i = zhong; i >= 1; i--)
	{
		shu = (shu * i) % mod;
		if (cha == 2)b = i;
		else if (cha == 1)a = i;
		cha--;
		if (cha == 0) break;
	}
	ans = (ans * shu) % mod;
	//开始计算
	for (int i = zhong + 1; i <n; i++)
	{
		jc = (jc * i) % mod;
		if (i == n-1)
		{
			ans = (ans + jc) % mod;
		}
		else
		{
			shu = (shu / a / b * i) % mod;
			ans = (ans + (jc * shu) % mod) % mod;
		}
		a += 2;
		b += 2;
	}
	cout << ans << endl;
	return 0;
}