#include<iostream>
#include<cstdio>
#define N 75
#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 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 Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
int n,ans,fac[N+1],invfac[N+1],inv[N+1],tong[N+1],length;
void dfs(int x,int y)
{
	if (!x)
	{
		int cnt,res=fac[n];
		for (int i=1;i<=length;++i)
			for (int j=1;j<=tong[i];++j)
			{
				cnt=tong[i]-j;
				for (int k=i+1;k<=length;++k) cnt+=(tong[k]>=j);
				res=1ll*res*inv[cnt+1]%mod;
			}
		if (length!=1) Adder(ans,1ll*res*res%mod);
		return;
	}
	for (int i=1;i<=min(x,y);++i)
	{
		if (length==1&&tong[1]!=i) continue;
		tong[++length]=i,dfs(x-i,i),--length;
	}
	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;
	n=read(),dfs(n,n),printf("%d\n",ans);
	return 0;
}