#include <bits/stdc++.h>
#define MISAKA main
#define ll long long
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define _rep(i,a,b) for(int i=a;i>=b;--i)
using namespace std;
inline int read(){
    char ch=getchar();int f=1,x=0;
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
    return x*f;
}
const double eps=1e-9;
const int N=5010,inf=1e9,mod=998244353;
int n,f[N][N],g[N],h[N],c[N][N],ans;
int add(int x,int y){x+=y;return x>=mod?x-mod:x;}
int del(int x,int y){x-=y;return x<0?x+mod:x;}
ll qp(ll a,ll b){ll r=1;for(;b;b>>=1,a=a*a%mod)if(b&1)r=r*a%mod;return r;}
void solve(int l,int r){
    memset(f,0,sizeof(f));f[l][1]=1;
    rep(i,l+1,r)rep(j,1,n)
        f[i][j]=add(f[i-1][j-1],add(i>1?f[i-2][j-1]:0,i>2?f[i-3][j-1]:0));
    rep(i,1,n) g[i]=add(g[i],f[r][i]);  
}
signed MISAKA(){
    n=read();c[0][0]=1;
    rep(i,1,n){c[i][0]=1;rep(j,1,i)c[i][j]=add(c[i-1][j],c[i-1][j-1]);}
    rep(l,1,3)rep(r,n-2,n)if(l<=r&&n+l-r<=3) solve(l,r);
    rep(i,1,n) h[i]=1ll*g[i]*qp(c[n][i],mod-2)%mod,ans=add(ans,1ll*i*del(h[i],h[i-1])%mod);
    printf("%d",ans);
    return 0;
}