#include<bits/stdc++.h>
#define int long long 
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e7 + 10, inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f; 

const int mod = 998244353;

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;
}
int fac[N], invfac[N];
int C(int a, int b) {
	if (a < 0 || b < 0 || b > a) return 0;
	return fac[a] * invfac[b] % mod * invfac[a - b] % mod;
}
void solve() {
	int n;
	cin >> n;
	
	fac[0] = 1;
	for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % mod;
	invfac[n] = qmi(fac[n], mod - 2);
	
	for (int i = n - 1; i >= 0; i--) invfac[i] = invfac[i + 1] * (i + 1) % mod;
	
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		ans += C(n - i, i - 1) * fac[i - 1] % mod * fac[n - i] % mod;
		ans %= mod; 
	}
	cout << ans << endl;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	
	// cin >> t;
	for(int i = 1; i <= t; i ++ ) {
		solve();
	}
	
}