#include<bits/stdc++.h>
using namespace std;
#define int long long 
const int NN=998244353;
int n;
int f[5050][5050];
int g[5050][5050];
int h[5050][5050];
int p[100100],ni[100100],ans;
int mi(int x,int y){
	int sum=1;
	for (;y;y>>=1,x=x*x%NN)
	if(y&1)sum=sum*x%NN;
	return sum;
}
signed main(){
	cin>>n;
	p[0]=1;
	for (int i=1;i<=n;i++)
	p[i]=p[i-1]*i%NN;
	ni[n]=mi(p[n],NN-2);
	for (int i=n;i;i--)
	ni[i-1]=ni[i]*i%NN;
	f[1][1]=1; 
	for (int i=2;i<=n;i++)
	for (int j=1;j<=i;j++)
	f[i][j]=(f[i][j]+f[i-1][j-1]+f[i-2][j-1]+f[i-3][j-1])%NN;
	g[2][1]=1; 
	for (int i=3;i<=n;i++)
	for (int j=1;j<=i;j++)
	g[i][j]=(g[i][j]+g[i-1][j-1]+g[i-2][j-1]+g[i-3][j-1])%NN;
	h[3][1]=1; 
	for (int i=4;i<=n;i++)
	for (int j=1;j<=i;j++)
	h[i][j]=(h[i][j]+h[i-1][j-1]+h[i-2][j-1]+h[i-3][j-1])%NN;
	int pre=0;
	for (int i=1;i<=n;i++){
		int t1=ni[n]*p[n-i]%NN*p[i]%NN;
		int t2=(f[n][i]+f[n-1][i]+f[n-2][i]+g[n][i]+g[n-1][i]+h[n][i])%NN;
		ans=(ans+(t1*t2-pre)*i)%NN;
		pre=t1*t2%NN;
//		cout<<t1<<" "<<t2<<" "<<ans<<"\n";
	}
	cout<<ans<<"\n";
}