#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define lowbit(x) ((x)&(-x))
#define endl '\n'
#define sc scanf
#define pt printf
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define ls k+k
#define rs k+k+1
using pll = pair<ll, ll>;
using pii = pair<int, int>;
const int N = 1e7 + 10;
const ll p=998244353;
ll fac[N],inv[N];
ll C(ll n,ll m)
{
	if(m>n)return 0;
	if(m==0&&n==0)return 1;
	return (fac[n]*inv[m]%p)*inv[n-m]%p;
}
ll qp(ll a,ll b)
{
	a=a%p;
	ll res=1;
	while(b)
	{
		if(b&1)res=res*a%p;
		a=a*a%p;
		b>>=1;
	}
	return res;
}
void UraykevoliQwQ()
{
	int n;cin>>n;
	ll ans=0;
	fac[0]=fac[1]=inv[0]=inv[1]=1;
	for(int i=1;i<=n;i++)
	{
		fac[i]=fac[i-1]*i%p;
		//inv[i]=qp(fac[i],p-2);
	}
	//for(int i=2;i<=n;i++)inv[i]=(ll)(p-p/i)*inv[p%i]%p;
	inv[n]=qp(fac[n],p-2);
	for(int i=n-1;i>=1;i--)
	{
		inv[i]=(i+1)*inv[i+1]%p;
	}
	//for(int i=n-1;i>=1;i--)
	//{
	//	inv[i]=i*inv[i+1]%p;
	//}
	for(int i=1;i<=n;i++)
	{
		ans=(ans+((C(n-i,i-1)*fac[i-1]%p)*fac[n-i])%p)%p;
	}
	cout<<ans<<endl;
}
int main()
{
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
	//int _;cin>>_;while(_--)
	UraykevoliQwQ();
	return 0;
}