#include <bits/stdc++.h>
#define int long long
#define endl "\n"

using namespace std;
typedef pair<int, int> PII;
const double epx = 1e-4;
const int mod = 998244353;
const int N = 1e7 + 10;
vector<int> x;
int n, fac[N], inv[N];

int qmi(int a, int b)
{
	int res = 1;
	while (b)
	{
		if (b & 1) res = (res * a) % mod;
		a = (a * a) % mod;
		b >>= 1;
	}
	return res % mod;
}

void init() {
	fac[0] = 1;
	for (int i = 1; i <= n; i++) fac[i] = (fac[i - 1] * i) % mod;
	inv[n] = qmi(fac[n], mod - 2);
	for (int i = n - 1; i >= 0; i -- ) {
		inv[i] = inv[i + 1] * (i + 1) % mod;
	}
}

int C(int n, int m)
{
	if (m > n) return 0;
	return ((fac[n] * inv[m] % mod) * inv[n - m]) % mod;
}

void solve()
{
	cin >> n;
//	n = 1e7;
	init();
	int ans = fac[n - 1];
	for (int i = 2; i <= n; i++)
	{
		if (n - i < i - 1) break;
		ans = (ans + (C(n - i, i - 1) * fac[i - 1] % mod) * fac[n - i]) % mod;
	}
	cout << (ans + mod) % mod << endl;
}


signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	int tt = 1;

//	cin>>tt;
	while (tt--) solve();
	return 0;
}