// created:  2025-02-13 15:48:08
#include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
#include<vector>
#define F(i,l,r) for(int i=(l),i##_end=(r);i<i##_end;++i)
#define I128 //||is_same<T,__int128_t>::value||is_same<T,__uint128_t>::value
using namespace std;
template<typename T>enable_if_t<is_integral<T>::value I128,void> readmain(T &x)
{
	bool neg=false;int c=getchar();
	for(;!isdigit(c);c=getchar())if(c=='-')neg=true;
	for(x=0;isdigit(c);c=getchar())x=(T)(10*x+(c-'0'));
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
typedef unsigned long long ull;
constexpr int N=(1<<21)+5,MOD=998244353,inv2=(MOD+1)>>1;
void reduce(int &x){if(x>=MOD)x-=MOD;}
int qpow(ull a,int b,ull c=1)
{
	for(;b;b>>=1,(a*=a)%=MOD)if(b&1)(c*=a)%=MOD;
	return (int)c;
}
namespace conv
{
	int r[N],g[N];
	ull a[N];
	void ntt(int *b,int n,bool inv)
	{
		int m=31^__builtin_clz(n);
		F(i,0,n)r[i]=r[i>>1]>>1|(i&1)<<(m-1),a[i]=b[r[i]];
		F(i,0,m)
		{
			int h=1<<i,s=2<<i,g_=qpow(3,(MOD-1)>>(i+1));
			F(j,g[0]=1,h)g[j]=(int)((ull)g[j-1]*g_%MOD);
			for(int l=0;l<n;l+=s)
			{
				ull *u=a+l,*v=a+l+h,x;
				for(int k=0;k<h;++k,++u,++v)
				{
					x=*v*g[k]%MOD;
					*v=*u+MOD-x;
					*u+=x;
				}
			}
			if(i==14)F(j,0,h)a[j]%=MOD;
		}
		if(inv)
		{
			ull invn=MOD-((MOD-1)>>m);
			reverse(a+1,a+n);
			F(i,0,n)a[i]*=invn;
		}
		F(i,0,n)b[i]=(int)(a[i]%MOD);
	}
	int getn(int n){return 1<<(32-__builtin_clz((n-1)|1));}
	void ntt(vector<int> &x,int n,bool inv)
	{
		x.resize(n);
		ntt(x.data(),n,inv);
	}
	vector<int> conv(vector<int> x,vector<int> y)
	{
		static int c[N],d[N];
		int n=1<<(32-__builtin_clz(((int)(x.size()+y.size()-2)|1)));
		memset(c,0,sizeof(int)*n);
		memset(d,0,sizeof(int)*n);
		memcpy(c,x.data(),sizeof(int)*x.size());
		memcpy(d,y.data(),sizeof(int)*y.size());
		if(n<=32)
		{
			static ull e[32];
			F(i,0,n)e[i]=0;
			F(i,0,(int)x.size())F(j,0,(int)y.size())e[i+j]+=(ull)c[i]*d[j];
			F(i,0,n)c[i]=(int)(e[i]%MOD);
		}
		else
		{
			ntt(c,n,false);
			ntt(d,n,false);
			F(i,0,n)c[i]=(int)((ull)c[i]*d[i]%MOD);
			ntt(c,n,true);
		}
		return vector<int>(c,c+x.size()+y.size()-1);
	}
}
int fac[N],invfac[N];
vector<int> inv(vector<int> a)
{
	int n=(int)a.size();
	if(n==1)return vector<int>{qpow(a[0],MOD-2)};
	int m=(n+1)>>1;
	vector<int> b=inv(vector<int>(a.begin(),a.begin()+m));
	int s=conv::getn(n+2*m-2);
	conv::ntt(a,s,false);
	conv::ntt(b,s,false);
	F(i,0,s)b[i]=(int)((ull)b[i]*(2+(ull)(MOD-a[i])*b[i]%MOD)%MOD);
	conv::ntt(b,s,true);
	b.resize(n);
	return b;
}
vector<int> deriv(const vector<int> &a)
{
	int n=(int)a.size();
	vector<int> b(n-1);
	F(i,1,n)b[i-1]=(int)((ull)i*a[i]%MOD);
	return b;
}
vector<int> integ(const vector<int> &a)
{
	int n=(int)a.size()+1;
	vector<int> b(n);
	F(i,1,n)b[i]=(int)((ull)a[i-1]*invfac[i]%MOD*fac[i-1]%MOD);
	return b;
}
vector<int> log(const vector<int> &a)
{
	vector<int> b=conv::conv(deriv(a),inv(a));
	b.resize(a.size()-1);
	return integ(b);
}
int n,f[N],g[N];
int main()
{
	read(n);
	F(i,fac[0]=1,n+1)fac[i]=(int)((ull)fac[i-1]*i%MOD);
	invfac[n]=qpow(fac[n],MOD-2);
	for(int i=n;i;--i)invfac[i-1]=(int)((ull)invfac[i]*i%MOD);
	int p2=1;
	F(i,f[0]=1,n+1)
	{
		f[i]=(int)((ull)f[i-1]*p2%MOD);
		reduce(p2<<=1);
	}
	F(i,1,n+1)f[i]=(int)((ull)f[i]*invfac[i]%MOD);
	memcpy(g,log(vector<int>(f,f+n+1)).data(),sizeof(int)*(n+1));
	int s=conv::getn(3*n+1);
	F(i,1,n+1)g[i]=(int)((ull)g[i]*i%MOD);
	conv::ntt(f,s,false);
	conv::ntt(g,s,false);
	F(i,0,s)f[i]=(int)((ull)f[i]*g[i]%MOD*g[i]%MOD);
	conv::ntt(f,s,true);
	int ans=(int)((ull)fac[n]*f[n]%MOD*inv2%MOD);
	printf("%d\n",ans);
	return 0;
}