#include<bits/stdc++.h>
using namespace std;
#define il inline
#define fi first
#define se second
#define mk make_pair
#define eb emplace_back
#define rep(i,l,r) for(int i=(l); i<=(r); ++i)
#define rep_(i,l,r) for(int i=(l); i>=(r); --i)
typedef long long lr;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
constexpr int mod1=998244353,mod2=1e9+7;
constexpr db pi=3.141592653589793,eps=1e-9;
constexpr int inf32=0x3f3f3f3f,Inf32=0xc0c0c0c0;
constexpr lr inf64=0x3f3f3f3f3f3f3f3f,Inf64=0xc0c0c0c0c0c0c0c0;
template<typename T>il T Max(T x,T y) { return (x>y)? x:y; }
template<typename T>il T Min(T x,T y) { return (x<y)? x:y; }
template<typename T>il T gcd(T x,T y) { return (!y)? x:gcd(y,x%y); }
template<typename T>il T Abs(T x) { return (x>0)? x:(-x); }
template<typename T>il T Rnd(T l,T r,mt19937_64 &eng)
{
	uniform_int_distribution<T> uid(l,r);
	return uid(eng);
}
mt19937_64 eng(chrono::high_resolution_clock::now().time_since_epoch().count());
constexpr int N=5050,mod=mod1;
int n,p[N],fac[N],inv[N];
il int Poww(int x,int y)
{
	int mul=1;
	while(y)
	{
		if(y&1)
			mul=(lr)mul*x%mod;
		x=(lr)x*x%mod,y>>=1;
	}
	return mul;
}
il int C(int x,int y) { return (x<y)? 0:((lr)fac[x]*inv[y]%mod*inv[x-y]%mod); }
il void Solve()
{
	cin>>n;
	fac[0]=1;
	rep(i,1,n)
		fac[i]=(lr)fac[i-1]*i%mod;
	inv[n]=Poww(fac[n],mod-2);
	rep_(i,n,1)
		inv[i-1]=(lr)inv[i]*i%mod;
	p[0]=1;
	rep(i,1,n)
	{
		int sum=C(n-1,i-1),now=0;
		rep(j,1,i)
		{
			int cur=(lr)C(i,j)*C(n-3*j-1,i-1)%mod;
			if(j&1)
				now=(now+cur)%mod;
			else
				now=(now-cur+mod)%mod;
		}
		p[i]=(lr)now*Poww(sum,mod-2)%mod;
	}
	int ans=0;
	rep(i,1,n)
		ans=(ans+(lr)i*(p[i-1]-p[i]))%mod;
	cout<<ans<<'\n';
}
int main()
{
#ifdef LOCAL
	string fpre="test",isuf="in",osuf="out";
	assert(freopen((fpre+"."+isuf).c_str(),"r",stdin));
	assert(freopen((fpre+"."+osuf).c_str(),"w",stdout));
#endif
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T=1;
	while(T--)
		Solve();
	return 0;
}