#include <bits/stdc++.h>
#define ll long long
#define debug(...) fprintf(stderr,__VA_ARGS__)
using namespace std;

inline static int read(){
    int sum=0,neg=0,ch=getchar();
    while(!isdigit(ch)) neg|=(ch=='-'),ch=getchar();
    while(isdigit(ch)) sum=sum*10+(ch^48),ch=getchar();
    return neg?-sum:sum;
}
constexpr int mod=998244353;
int dp[5005][5005],fac[5005],inv[5005];
int power(ll a,int b){
    ll ret=1;
    while(b){
        if(b&1) ret=ret*a%mod;
        a=a*a%mod,b>>=1;
    } return ret;
}
signed main(){
    // freopen("color.in","r",stdin);
    // freopen("color.out","w",stdout);
    int n=read(),ans=0; **dp=*fac=*inv=1;
    for(int i=1;i<=n;i++) fac[i]=(ll)fac[i-1]*i%mod; inv[n]=power(fac[n],mod-2);
    for(int i=n-1;i;i--) inv[i]=(ll)inv[i+1]*(n-i)%mod;
    for(int i=3;i<=n;i++) for(int j=0;j<i;j++)
        dp[i][j+1]=((ll)dp[i-1][j]+dp[i-2][j]+dp[i-3][j])%mod;
    for(int _=1,t=n-1;_<=3;_++,t--) for(int i=0;i<=t;i++)
        ans=(ans+(4ll-_)*i*dp[t][i]%mod*fac[i]%mod*inv[i+1])%mod;
    return printf("%lld\n",((ll)ans*n+1)%mod),0;
}