#include<bits/stdc++.h>
#define int long long
#define lowbit(x) x&(-x)
#define endl '\n'

using namespace std;

const int N=2e6+10;
const int mod=998244353;
typedef pair<int,int>PII;
int a[N],f[N],fact[N],infact[N];
int qmi(int a, int k, int p)    // 快速幂模板
{
	int res = 1;
	while (k)
	{
		if (k & 1) res =res * a % p;
		a = a * a % p;
		k >>= 1;
	}
	return res;
}
int C(int n,int m){
	if(n<0||m<0)return 0;
	if(m>n)return 0;
	return ((fact[n]%mod*infact[m])%mod*infact[n-m]%mod)%mod;
}
void init()
{
	fact[0] = infact[0] = 1;
	for (int i = 1; i <N; i ++ )
	{
		fact[i] = fact[i - 1] * i % mod;
		infact[i] = infact[i - 1] * qmi(i, mod - 2, mod) % mod;
	}
}
void solve()
{
	int n;
	cin>>n;
	int ans=fact[n-1]%mod;
	for(int i=2;i<=n;i++)
	{
		ans=(ans+C(n-i,i-1)%mod*fact[i-1]%mod*fact[n-i]%mod)%mod;
	}
	cout<<ans<<endl;
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t=1;
	init();
//	cin>>t;
	while(t--)solve();
	return 0;
}