#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=5e3+5,mod=998244353;
int f[maxn][3],ans,n,fac[maxn],inv[maxn];
int fast_power(int x,int k)
{
    if(k==0) return 1;
    int tmp=fast_power(x,k/2);
    if(k%2==0) return tmp*tmp%mod;
    else return tmp*tmp%mod*x%mod;
}
int C(int x,int y){return fac[x]*inv[y]%mod*inv[x-y]%mod;}
signed main()
{
    cin>>n,f[1][0]=1,inv[0]=inv[1]=fac[0]=fac[1]=1;
    for(int i=2;i<=n;i++)
    {
        fac[i]=fac[i-1]*i%mod,inv[i]=fast_power(fac[i],mod-2);
        // cout<<fac[i]<<" "<<inv[i]<<"\n";
        for(int k=i;k>=1;k--)
        {
            f[k][2]=f[k][1],f[k][1]=f[k][0];
            f[k][0]=(f[k-1][0]+f[k-1][1]+f[k-1][2])%mod;
        }
    }
    for(int i=1;i<=n;i++)
    {
        int sum=(f[i][0]+f[i][1]+f[i][2])%mod;
        // cout<<sum<<" "<<(fac[n]*fast_power(C(n,i),mod-2)%mod)*(C(n,i)-sum*n%mod*fast_power(i,mod-2)%mod+mod)%mod<<"\n";
        (ans+=(fac[n]*fast_power(C(n,i),mod-2)%mod)*(C(n,i)-sum*n%mod*fast_power(i,mod-2)%mod+mod)%mod)%mod;
        ans%=mod;
    }
    cout<<ans*inv[n]%mod+1;
}