Let X = 10^{100}. Inaba has N checker pieces on the number line, where the i-th checker piece is at coordinate X^{i} for all 1 \leq i \leq N.

Every second, Inaba chooses two checker pieces, A and B, and move A to the symmetric point of its current position with respect to B. After that, B is removed. (It is possible that A and B occupy the same position, and it is also possible for A to occupy the same position as another checker piece after the move).

After N - 1 seconds, only one checker piece will remain. Find the number of distinct possible positions of that checker piece, modulo 10^{9} + 7.

Constraints

* 1 \leq N \leq 50
* N is an integer.

Input

Input is given from Standard Input in the following format:


N


Output

Print the number of distinct possible positions of the final checker piece, modulo 10^{9} + 7.

Examples

Input

3


Output

12


Input

4


Output

84


Input

22


Output

487772376
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<cstdlib>
#define cmax(a,b) (a<(b)?a=(b),1:0)
#define cmin(a,b) (a>(b)?a=(b),1:0)
#define dmin(a,b) ((a)<(b)?(a):(b))
#define dmax(a,b) ((a)>(b)?(a):(b))
#define CL fclose(stdin),fclose(stdout)
namespace io
{
	int F()
	{
		int n=0,F=1;
		char ch;
		while((ch=getchar())!='-'&&(ch<'0'||ch>'9'));
		ch=='-'?F=0:n=ch-'0';
		while((ch=getchar())>='0'&&ch<='9')n=(n<<1)+(n<<3)+ch-'0';
		return F?n:-n;
	}
	long long G()
	{
		long long n=0,F=1;
		char ch;
		while((ch=getchar())!='-'&&(ch<'0'||ch>'9'));
		ch=='-'?F=0:n=ch-'0';
		while((ch=getchar())>='0'&&ch<='9')n=(n<<1)+(n<<3)+ch-'0';
		return F?n:-n;
	}
}
int c[555][555];
int f[555][555][2];
int main()
{
	//freopen("rabbit.in","r",stdin);
	//freopen("rabbit.out","w",stdout);
	int n=io::F(),M=1000000007;
	for(register int i=0;i<=n;++i)c[i][0]=c[i][i]=1;
	for(register int i=2;i<=n;++i)
		for(register int j=1;j<i;++j)
			c[i][j]=(c[i-1][j-1]+c[i-1][j])%M;
	f[1][0][0]=c[n][1];
	f[1][1][0]=c[n][1];
	#define register 
	for(register int i=1;i<n;++i)
		for(register int j=0;j<=i;++j)
			for(register int k=0;k<=1;++k)
				if(f[i][j][k])
				{
					long long F=f[i][j][k];
					for(register int x=0;x+i<=n;++x)
					{
						register int y=x==0?1:0;
						if((x+y^j)&1)++y;
						for(;x+y+i<=n;y+=2)
						{
							int cnt=x+y;
							if(cnt<j)continue;
							int ck=j+(cnt-j)/2,ct=cnt-ck;
							if(ck>x)
								f[i+cnt][ck-x][k]=(f[i+cnt][ck-x][k]+F*c[n-i][x]%M*c[n-i-x][y])%M;
								else if(ck<x)
									f[i+cnt][x-ck][!k]=(f[i+cnt][x-ck][!k]+F*c[n-i][x]%M*c[n-i-x][y])%M;
									else f[i+cnt][0][0]=(f[i+cnt][0][0]+F*c[n-i][x]%M*c[n-i-x][y])%M;
						}
					}
				}
	printf("%d\n",f[n][0][0]);
	return 0;
}

