#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<algorithm>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<map>
#include<string>
#include<iomanip>
#include<climits>
#include <sstream>
#include<functional>
#include <unordered_map>
#include<array>
using namespace std;
using ll = long long;
ll t, n, k, a, b;
const ll N = 1e7+10;
const ll MOD = 998244353;
ll fac[N], ifac[N];
ll quickPower(ll a, ll b, ll mod = MOD) {
	ll ans = 1, base = a;
	while (b > 0) {
		if (b & 1)
			(ans *= base) %= mod;

		(base *= base) %= mod;
		b >>= 1;
	}
	return ans;
}
ll fpm(ll x) //费马小定理
{
	return quickPower(x, MOD - 2);
}

int main()
{
	ll n;
	cin >> n;
	fac[0] = 1;
	for (int i = 1; i <= n ; i++) {
		fac[i] = fac[i - 1] * i %MOD;
		ifac[i] = fpm(fac[i]);
	}
	ll sum = 0;
	for (int i = n/2; i <= n - 2; i++) {
		ll N = n - 1 - i;
		ll M = i;
		sum = (sum + fac[M] * ifac[M - N] % MOD * fac[M] % MOD) % MOD;
	}
	sum = (sum + fac[n - 1]) % MOD;
	cout << sum;
}