#include<bits/stdc++.h>
#define ShuaiBi main
using namespace std;
typedef long long ll;
const int N=5003;
const ll mod=998244353;
ll Pow(ll a,ll b){
	ll ans=1;
	while(b){
		if(b&1) ans=ans*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ans;
}
ll Inv(ll x){return Pow(x%mod,mod-2);}
ll gcd(ll x,ll y){return !y?x:gcd(y,x%y);}
ll n,ans,ji[N],inv[N],s[N];
void init(){
	ji[0]=1;for(int i=1;i<=n;i++) ji[i]=ji[i-1]*i%mod;
	inv[n]=Inv(ji[n]);
	for(int i=n-1;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
}
ll C(ll n,ll m){return ji[n]*inv[m]%mod*inv[n-m]%mod;}
int ShuaiBi(){
//	freopen("color.in","r",stdin);
//	freopen("color.out","w",stdout);
	scanf("%lld",&n);
	if(n==3) return puts("1"),0;
	init();n--;
	for(int x=1;x<=n;x++){
		ll sum=0;
		for(int len:{n-2,n-1,n})
			for(int a=0;a<=x;a++){//a+2b+3c=len,a+b+c=x
				int c=len-2*x+a,b=x-a-c;
				if(a>=0 && b>=0 && c>=0) sum=(sum+C(x,a)*C(x-a,b)%mod*ji[x]%mod)%mod;
			}
		s[x]=sum*ji[n-x]%mod;
		ans=(ans+(s[x]-s[x-1])*inv[n]%mod*x%mod)%mod; 
	}
	printf("%lld\n",(ans%mod+mod+1)%mod);
	return 0;
}