#include<iostream>
#include<cstdio>
#define N 200000
#define Z 19
#define M 524288
#define g 3
#define mod 998244353
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int n,sz,length,rev[M+1],num[M+1],fac[N+1],invfac[N+1],inv[N+1],dp[N+1],dp2[N+1],F[N+1],G[N+1],H[N+1],W[N+1],K[N+1],R[N+1],S[N+1],s1[M+1],s2[M+1],s3[M+1],s4[M+1],s5[M+1],s6[M+1],s7[M+1],s8[M+1],s9[M+1],s10[M+1],s11[M+1],s12[M+1],s13[M+1],s14[M+1],s15[M+1],s16[M+1],s17[M+1],s18[M+1],s19[M+1],wn[Z+1][M+1],wn2[Z+1][M+1];
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
void NTT(int limit,int *s,int type)
{
	int s1,s2;
	for (int i=1;i<limit;++i) rev[i]=(rev[i>>1]>>1)|((i&1)?limit>>1:0);
	for (int i=1;i<limit;++i)
		if (rev[i]>i)
			swap(s[i],s[rev[i]]);
	if (type==1)
	{
		for (int i=2;i<=limit;i<<=1)
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<j+(i>>1);++k)
					s1=s[k],s2=1ll*s[k+(i>>1)]*wn[num[i]][k-j]%mod,s[k]=MD(s1+s2),s[k+(i>>1)]=MD2(s1-s2);
	}
	else
	{
		for (int i=2;i<=limit;i<<=1)
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<j+(i>>1);++k)
					s1=s[k],s2=1ll*s[k+(i>>1)]*wn2[num[i]][k-j]%mod,s[k]=MD(s1+s2),s[k+(i>>1)]=MD2(s1-s2);
		s1=fast_pow(limit,mod-2);
		for (int i=0;i<=limit;++i) s[i]=1ll*s[i]*s1%mod;
	}
	return;
}
void solve(int l,int r)
{
	if (l==r)
	{
		Adder(F[l],MD2(W[l-1]-S[l-1])),Adder(G[l],MD2(W[l-1]-K[l-1])),W[l]=1ll*W[l]*inv[l]%mod,K[l]=1ll*K[l]*inv[l]%mod,Adder(W[l],F[l]),Adder(K[l],H[l]),Adder(S[l],R[l]);
		return;
	}
	int mid=(l+r)>>1;
	solve(l,mid);
	int limit=1;
	while (limit<=min(sz,r-l)+mid-l) limit<<=1;
	for (int i=0;i<=limit;++i) s1[i]=s2[i]=s3[i]=s4[i]=s5[i]=s6[i]=s7[i]=s8[i]=s9[i]=s10[i]=s11[i]=s12[i]=s13[i]=s14[i]=0;
	for (int i=l;i<=mid;++i) s1[i-l]=F[i],s2[i-l]=G[i],s3[i-l]=1ll*F[i]*i%mod,s4[i-l]=1ll*H[i]*i%mod,s5[i-l]=W[i],s6[i-l]=K[i],s7[i-l]=R[i];
	for (int i=0;i<=min(sz,r-l);++i) s8[i]=F[i],s9[i]=G[i],s10[i]=1ll*F[i]*i%mod,s11[i]=1ll*H[i]*i%mod,s12[i]=W[i],s13[i]=K[i],s14[i]=R[i];
	NTT(limit,s1,1),NTT(limit,s2,1),NTT(limit,s3,1),NTT(limit,s4,1),NTT(limit,s5,1),NTT(limit,s6,1),NTT(limit,s7,1),NTT(limit,s8,1),NTT(limit,s9,1),NTT(limit,s10,1),NTT(limit,s11,1),NTT(limit,s12,1),NTT(limit,s13,1),NTT(limit,s14,1);
	for (int i=0;i<=limit;++i) s15[i]=MD(1ll*s1[i]*s9[i]%mod+1ll*s8[i]*s2[i]%mod),s16[i]=2ll*s2[i]*s9[i]%mod,s17[i]=MD(1ll*s3[i]*s12[i]%mod+1ll*s10[i]*s5[i]%mod),s18[i]=MD(1ll*s4[i]*s13[i]%mod+1ll*s11[i]*s6[i]%mod),s19[i]=MD(1ll*s6[i]*s14[i]%mod+1ll*s13[i]*s7[i]%mod);
	NTT(limit,s15,-1),NTT(limit,s16,-1),NTT(limit,s17,-1),NTT(limit,s18,-1),NTT(limit,s19,-1);
	for (int i=mid+1;i<=r;++i) Adder(F[i],s15[i-l]),Adder(G[i],s16[i-l]),Adder(H[i],s15[i-l]),Adder(W[i],s17[i-l]),Adder(K[i],s18[i-l]),Adder(R[i],s16[i-l]),Adder(S[i],s19[i-l]);
	solve(mid+1,r);
	return;
}
void calc(int x)
{
	if (x==1)
	{
		F[x]=W[x]=1;
		return;
	}
	int limit=1;
	calc((x+1)>>1);
	while (limit<=x+1) limit<<=1;
	for (int i=0;i<=limit;++i) s1[i]=s2[i]=s3[i]=s4[i]=s5[i]=s6[i]=s7[i]=0;
	for (int i=0;i<=((x+1)>>1);++i) s1[i]=F[i],s2[i]=G[i],s3[i]=1ll*F[i]*i%mod,s4[i]=1ll*H[i]*i%mod,s5[i]=W[i],s6[i]=K[i],s7[i]=R[i];
	NTT(limit,s1,1),NTT(limit,s2,1),NTT(limit,s3,1),NTT(limit,s4,1),NTT(limit,s5,1),NTT(limit,s6,1),NTT(limit,s7,1);
	for (int i=0;i<=limit;++i) s8[i]=1ll*s1[i]*s2[i]%mod,s9[i]=1ll*s2[i]*s2[i]%mod,s10[i]=1ll*s3[i]*s5[i]%mod,s11[i]=1ll*s4[i]*s6[i]%mod,s12[i]=1ll*s6[i]*s7[i]%mod;
	NTT(limit,s8,-1),NTT(limit,s9,-1),NTT(limit,s10,-1),NTT(limit,s11,-1),NTT(limit,s12,-1);
	for (int i=((x+1)>>1)+1;i<=x;++i) Adder(F[i],s8[i]),Adder(G[i],s9[i]),Adder(H[i],s8[i]),Adder(W[i],s10[i]),Adder(K[i],s11[i]),Adder(R[i],s9[i]),Adder(S[i],s12[i]);
	sz=((x+1)>>1),solve(((x+1)>>1)+1,x);
	return;
}
int main()
{
	fac[0]=1;
	for (int i=1;i<=N;++i) fac[i]=1ll*fac[i-1]*i%mod;
	invfac[N]=fast_pow(fac[N],mod-2);
	for (int i=N-1;i>=0;--i) invfac[i]=1ll*invfac[i+1]*(i+1)%mod;
	for (int i=1;i<=N;++i) inv[i]=1ll*fac[i-1]*invfac[i]%mod;
	for (int i=2,w;i<=M;i<<=1)
	{
		num[i]=++length,w=fast_pow(g,(mod-1)/i);
		for (int j=0,res=1;j<(i>>1);++j,res=1ll*res*w%mod) wn[num[i]][j]=res;
		w=fast_pow(g,(mod-1)/i*(i-1));
		for (int j=0,res=1;j<(i>>1);++j,res=1ll*res*w%mod) wn2[num[i]][j]=res;
	}
	n=read(),calc(n),W[0]=K[0]=1,printf("%lld\n",1ll*MD(F[n]+G[n])*fac[n]%mod);
	return 0;
}