#include<bits/stdc++.h>
#define lint long long
using namespace std;
inline lint read(){
    char c; lint f=1,res=0;
    while(c=getchar(),!isdigit(c)) if(c=='-') f*=-1;
    while(isdigit(c)) res=res*10+c-'0',c=getchar();
    return res*f;
}
void write(int x){
    if(x<0){
        putchar('-');
        x=-x;
    }
    static int sta[35];
    int top=0;
    do{
        sta[top++]=x%10,x/=10;
    }while(x);
    while(top)putchar(sta[--top]+'0');
}
const int N=5005,mod=998244353;
lint n,f[N][N],fac[N],ans;
inline lint ksm(lint a,lint b){
	lint res=1;
	while(b){
		if(b&1) res=(res*a)%mod;
		a=(a*a)%mod;
		b>>=1;
	}
	return res;
}
inline bool check(){
	return n<=3;
}
int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    n=read();
    if(check()) puts("1"),exit(0);
    f[1][1]=fac[1]=1;
    for(int i=2;i<=n;i++){
    	fac[i]=(fac[i-1]*i)%mod;
    	for(int j=1;j<=n;j++){
    		f[i][j]=(f[i-1][j-1]+f[i-2][j-1])%mod;
    		if(i>=4) f[i][j]=(f[i][j]+f[i-3][j-1])%mod;
		}
	}
	for(int i=1;i<=n;i++) ans=(ans+((f[n-3][i-1]*2+f[n-4][i-1]+f[n-2][i])%mod)*i%mod*fac[i-1]%mod*fac[n-i]%mod)%mod;
	int inv=ksm(fac[n-1],mod-2);
	printf("%lld",ans*inv%mod);
    return 0;
}