#include <cstdio>
#include <cstring>
#include <algorithm>
const int N=400010;
const int P=998244353;
typedef long long LL;
inline int Pow(int x,int y){int ret=1;while(y){if(y&1)ret=(LL)ret*x%P;x=(LL)x*x%P,y>>=1;}return ret;
}
int A[N],B[N],rev[N],len;
int ai[N],bi[N],ci[N];
int jie[N],ni[N],inv[N],n;
inline void ntt(int *C,int opt){register int i,j,k,w;int wn,temp;for(i=1;i<len;++i)if(i<rev[i])std::swap(C[i],C[rev[i]]);for(k=2;k<=len;k<<=1){wn=Pow(3,(P-1)/k);if(opt==-1)wn=Pow(wn,P-2);for(i=0;i<len;i+=k){w=1;for(j=0;j<(k>>1);++j,w=(LL)w*wn%P){temp=(LL)w*C[i+j+(k>>1)]%P;C[i+j+(k>>1)]=(C[i+j]-temp+P)%P;C[i+j]=(C[i+j]+temp)%P;}}}
}
inline void mul(int *a,int *b,int *c,int n){len=1;while(len<n)len<<=1;int i;for(i=1;i<len;++i)rev[i]=(rev[i>>1]>>1)|((i&1)?(len>>1):0);for(i=0;i<len;++i)A[i]=a[i],B[i]=b[i];ntt(A,1),ntt(B,1);for(i=0;i<len;++i)A[i]=(LL)A[i]*B[i]%P;ntt(A,-1);int Inv=Pow(len,P-2);for(i=0;i<len;++i)c[i]=(LL)A[i]*Inv%P;
}
int main(){scanf("%d",&n);int i,ans=1,temp=1;jie[0]=ni[0]=1,inv[1]=1;for(i=2;i<=n;++i)inv[i]=((-(LL)(P/i)*inv[P%i])%P+P)%P;for(i=1;i<=n;++i)jie[i]=(LL)jie[i-1]*i%P,ni[i]=(LL)ni[i-1]*inv[i]%P;bi[0]=0,bi[1]=n,ai[0]=1,ai[1]=P-1;for(i=2;i<=n;++i)bi[i]=(LL)i*(Pow(i,n)-1+P)%P*ni[i]%P*inv[i-1]%P,ai[i]=(i&1)?(P-ni[i]):ni[i];mul(ai,bi,ci,n+n+2);for(i=1;i<=n;++i)temp=(((LL)temp)<<1LL)%P,ans=(ans+(LL)ci[i]*temp%P*jie[i])%P;printf("%d\n",ans);return 0;
}

#include <cstdio>
#include <cstring>
#include <algorithm>
typedef long long LL;
const int N=100010;
const int P=998244353;
inline int Pow(int x,int y){int ret=1;while(y){if(y&1)ret=(LL)ret*x%P;x=(LL)x*x%P,y>>=1;}return ret;
}
int len,n,A[N<<2],rev[N<<2];
int g[N<<2],f[N<<2],jie[N],ni[N];
inline void ntt(int *C,int opt){register int i,j,k,w;int wn,temp;for(i=1;i<len;++i)if(rev[i]>i)std::swap(C[i],C[rev[i]]);for(k=2;k<=len;k<<=1){wn=Pow(3,(P-1)/k);if(opt==-1)wn=Pow(wn,P-2);for(i=0;i<len;i+=k){w=1;for(j=0;j<(k>>1);++j,w=(LL)w*wn%P){temp=(LL)w*C[i+j+(k>>1)]%P;C[i+j+(k>>1)]=(C[i+j]-temp+P)%P;C[i+j]=(C[i+j]+temp)%P;}}}
}
inline void Inv(int *a,int *b,int cd){if(cd==1){b[0]=Pow(a[0],P-2);return;}Inv(a,b,cd>>1);int i,inv;len=cd<<1;for(i=1;i<len;++i)rev[i]=(rev[i>>1]>>1)|((i&1)?(len>>1):0);memcpy(A,a,cd<<2),memset(A+cd,0,cd<<2);ntt(A,1),ntt(b,1);for(i=0;i<len;++i)b[i]=(2-(LL)A[i]*b[i]%P+P)*b[i]%P;ntt(b,-1),inv=Pow(len,P-2);for(i=0;i<cd;++i)b[i]=(LL)b[i]*inv%P;memset(b+cd,0,cd<<2);
}
int main(){scanf("%d",&n);int i,cd,ans=0;jie[0]=ni[0]=1;for(i=1;i<=n;++i)jie[i]=(LL)jie[i-1]*i%P;ni[n]=Pow(jie[n],P-2);for(i=n-1;i>0;--i)ni[i]=(LL)ni[i+1]*(i+1)%P;g[0]=1;for(i=1;i<=n;++i)g[i]=(-2*ni[i]+P+P)%P;cd=1;while(cd<=n)cd<<=1;Inv(g,f,cd);for(i=0;i<=n;++i)ans=(ans+(LL)f[i]*jie[i])%P;printf("%d\n",ans);return 0;
}