#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
int n,m,t,k;
const int N=1e7+5,mod=998244353;
typedef pair<int,int> PII;
int frac[5000005],inv[5000005],jie[5000005]; 
const int p=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(){
	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(false), std::cin.tie(nullptr), std::cout.tie(nullptr);
    int __=1;
    //cin>>__;
    //init();
	while(__--){
		solve();
	}
	return 0;
}