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

queue<int> q;

void solve()
{
	int n;
	cin >> n;

	int ans = 1;
	for (int i = 1; i <= (n - n % 2) / 2; i++)
	{
		ans = (ans * i) % mod;
	}
	ans = (ans * ans) % mod;
	for (int i = 2 - n % 2; i <= (n - n % 2) / 2; i++)
	{
		q.push(i);
	}
	
	int sum = 0;
	for (int i = 1; i <= (n + 1) / 2; i++)
	{
		sum = (sum + ans) % mod;
		// cout << sum << endl;
		if (q.size() == 1)
		{
			ans = ans / q.front();
			ans = (ans * (q.back() + 1)) % mod;
			q.pop();
		}
		else if (q.size() >= 2)
		{
			ans = ans / q.front();
			
			q.pop();
			q.push(q.back() + 1);

			ans = (ans * q.back()) % mod;

			ans = (ans * q.back()) % mod;

			ans = ans / q.front();
			
			q.pop();
		}
	}
	cout << sum;
	return;
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t;
	// cin >> t;
	t = 1;
	while (t--)
	{
		solve();
	}
}