#include<bits/stdc++.h>
using namespace std;
const int N=5005,M=998244353;
int f[N][N],n,fac[N],inv[N],ans;
int qpow(int x,int y,int res=1){
    while(y){
        if(y&1)res=1ll*res*x%M;
        x=1ll*x*x%M,y>>=1;
    } return res;
}
int md(int x){if(x>=M)x-=M;return x;}
int C(int x,int y){
    return 1ll*fac[x]*inv[y]%M*inv[x-y]%M;
}
signed main(){
    ios::sync_with_stdio(false);
    // freopen("color.in","r",stdin);
    // freopen("color.out","w",stdout);
    int i,j,k,l,r,x,y,z;
    cin>>n,f[1][1]=1,fac[0]=inv[0]=1;
    for(i=2;i<=n;++i)for(j=min(i-1,n-3);j>=i-3&&j>0;--j)
        for(k=1;k<=n;++k)f[i][k+1]=md(f[i][k+1]+f[j][k]);
    for(i=1;i<=n;++i)fac[i]=1ll*fac[i-1]*i%M;
    inv[n]=qpow(fac[n],M-2);
    for(i=n-1;i;--i)inv[i]=inv[i+1]*(i+1ll)%M;
    for(i=n-2;i<=n;++i)for(j=1;j<=n;++j)
        ans=(ans+1ll*f[i][j]*qpow(C(n-1,j-1),M-2)%M*j)%M;
    printf("%d\n",ans);
    return 0;
}