#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll p=1e9+7;
ll n,f[101][101],jc[101],ny[101];
ll ksm(ll x,ll y){
	ll xlh=1;
	while(y){
		if(y&1)xlh=xlh*x%p;
		x=x*x%p;
		y/=2;
	}
	return xlh;
}
ll C(ll x,ll y){
	return jc[x]*ny[y]%p*ny[x-y]%p;
}
int main(){
	ll i,j,k,l,x;
	scanf("%lld",&n);
	jc[0]=ny[0]=1;
	f[1][1]=f[1][0]=n;
	for(i=1;i<=n;i++)jc[i]=jc[i-1]*i%p,ny[i]=ksm(jc[i],p-2);
	for(i=1;i<n;i++)
	 for(j=1;j<=n-i;j++)
	  for(k=0;k<=j;k++){
	  	if((j-k)%2)continue;
	  	x=(j-k)/2;
	  	for(l=0;l<=j;l++)(f[i+j][abs(x-l)]+=f[i][k]*C(n-i,j)%p*C(j,l))%=p;
	  }
	printf("%lld",f[n][0]);
}