#include <bits/stdc++.h>
using namespace std;
#define ri register int
typedef long long ll;
const int N=55,mod=1e9+7;
int c[N][N],f[N][N];
int main(){
	ri n,i,j,k,x,y;
	scanf("%d",&n);
	for(i=0;i<=n;++i){
		c[i][0]=1;
		for(j=1;j<=i;++j)
			c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod; 
	}
	f[1][0]=f[1][1]=n;
	for(i=1;i<n;++i)
		for(j=0;j<=i;++j)
			if(f[i][j])
				for(k=max(1,j);k<=n-i;++k)
					if(~(k-j)&1){
						y=(k-j)/2;
						for(x=0;x<=k;++x)
							f[i+k][abs(x-y)]=(f[i+k][abs(x-y)]+(ll)f[i][j]*c[n-i][k]%mod*c[k][x])%mod;
					}
	printf("%d\n",f[n][0]);
	return 0;
}