#include<bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int n;
const int N = 5050;
int f[N],ifac[N],fac[N];
template <typename T>inline void read(T &x)
{
	x=0;char c=getchar();bool f=0;
	for(;c<'0'||c>'9';c=getchar())f|=(c=='-');
	for(;c>='0'&&c<='9';c=getchar())x=(x<<1)+(x<<3)+(c^48);
	x=(f?-x:x); 
}
inline int add(int a,int b)
{
	return a+b>=mod?a+b-mod:a+b;
}
int Pow(int a,int b)
{
	int res=1;
	while(b)
	{
		if(b&1)res=1ll*res*a%mod;
		a=1ll*a*a%mod;
		b>>=1;
	}
	return res;
}
int main()
{
	cin>>n;
	if(n<=3)
	{
		cout<<1;
		return 0;
	}
	fac[0]=1;
	for(int i=1;i<=n;i++)fac[i]=1ll*fac[i-1]*i%mod;
	ifac[n]=Pow(fac[n],mod-2);
	for(int i=n-1;i>=0;i--)ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
	f[1]=0;f[2]=0;
	for(int i=3;i<=n;i++)
	{
		for(int j=1;j<=i;j++)
		{
			f[i]=add(f[i],1ll*f[i-j]*fac[i-1]%mod*ifac[i-j]%mod);
			f[i]=add(f[i],1ll*f[j-1]*fac[i-1]%mod*ifac[j-1]%mod);
			f[i]=add(f[i],fac[i-1]);
		}
	}
	cout<<(1ll*f[n-1]*ifac[n-1]%mod+1)%mod<<endl;
	return 0;
}