#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 998244353;
const int N = 10000010;
typedef long long ll;
typedef pair<int, int> PII;

	ll fac[N], inv[N];
	
	ll fastpow(ll a, ll n){
		ll base = a, res = 1;
		while(n){
			if(n & 1) res = (res * base) % mod;
			base = (base * base) % mod;
			n >>= 1;
		}
		return res;
	}
	
	ll Inv(ll a){
		return fastpow(a, mod - 2);
	}

	ll C(ll n, ll m){
		if(n < 0 || m < 0 || n < m) return 0;
		return fac[n] * inv[m] % mod * inv[n - m] % mod;
	}
	
	void init(ll n){
		fac[0] = 1;
		for(int i = 1; i <= n; i ++) fac[i] = (i * fac[i - 1]) % mod;
		inv[n] = Inv(fac[n]);
		for(int i = n - 1; i >= 0; i --) inv[i] = inv[i + 1] * (i + 1) % mod;
	}
	
void solve(){
	int n ; cin >> n;
	int res = fac[n - 1];
	for(int i = n - 2; i >= n / 2 ;i --)
	{
		int t = 0;
		t= fac[i] * fac[n - i - 1];
		t %= mod;
		t *= C(i, n - i - 1);
		res += t;
		res %= mod;
	}
	cout << res % mod << endl;
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	init(N - 10);
	int t = 1;
	while(t --){
		solve();
	}
	return 0;
}