#include <bits/stdc++.h>
using namespace std;

#define ll long long
const int mod = 998244353;
const int N = 1e7+10;
ll fac[N], invfac[N];

ll ksm(ll A, ll B, ll p) {
	ll res = 1;
	while (B) {
		if (B&1) {
			res *= A;
			res %= p;
		}
		B /= 2;
		A *= A;
		A %= p;
	}
	return res;
} 

void init() {
	ll i, j;
	fac[0] = fac[1] = 1;
	invfac[0] = invfac[1] = 1;
	for (i = 1; i < N; i++) {
		fac[i] = fac[i-1] * i % mod;
	}
	invfac[N-1] = ksm(fac[N-1], mod-2, mod);
	for (i = N-1; i >= 2; i--) {
		invfac[i-1] = invfac[i] * i % mod;
	}
}

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

ll A(int n) {
	return fac[n];
}

void solve() {
	int n, i, j;
	ll ans = 0;
	cin>>n;
	for (i = 1; i <= n; i++) {
		ans += C(n-i, i-1) * A(i-1) % mod * A(n-i) % mod;
		ans %= mod;
	}
	cout<<ans<<'\n';
}

// 1 1 3 

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	init();
	int T = 1;
//	cin>>T;
	while (T--) {
		solve();
	}
	return 0;
}