#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
//cout<<setprecision(20)
const llint mod=1000000007;//ここを変えるとよい 
const llint big=1e17+10;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=0.0000000001;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
int LBI(vector<lldo>&ar,lldo in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
int UBI(vector<lldo>&ar,lldo in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}

#define mnt mint_base
class mint_base;
//mint_base_base型用の累乗関数
constexpr mint_base m_pow(mint_base x, uint64_t n)noexcept;
//mod計算を自動で行う整数テンプレートクラス
class mint_base
{
public:
	constexpr mint_base operator+(const mint_base &other)const noexcept
	{auto v = *this;return v += other;}
	constexpr mint_base operator-(const mint_base &other)const noexcept
	{auto v = *this;return v -= other;}
	constexpr mint_base operator*(const mint_base &other)const noexcept
	{auto v = *this;return v *= other;}
	constexpr auto operator/(const mint_base &other)const noexcept
	{auto v = *this;return v /= other;}
	constexpr mint_base & operator+=(const mint_base &other) noexcept
	{a += other.a;if (mod <= a) { a -= mod; };return *this;}
	constexpr mint_base & operator-=(const mint_base &other) noexcept
	{if (a >= other.a) {a -= other.a;}else {a = (a + mod) - other.a;}return *this;}
	constexpr mint_base & operator*=(const mint_base &other) noexcept
	{a *= other.a;a %= mod;return *this;}
	constexpr mint_base & operator/=(const mint_base &other) noexcept
	{return *this *= ~other;}
	constexpr mint_base operator+()const noexcept { return *this; }
	constexpr mint_base operator-()const noexcept
	{return{ mod - a, mod_value_tag{} };}
	constexpr mint_base & operator++() noexcept
	{if (mod <= ++a) { a = 0; };return *this;}
	constexpr mint_base & operator--() noexcept
	{if (a <= 0) { a = mod; };--a;return *this;}
	constexpr mint_base operator++(int) noexcept
	{auto tmp = *this;++*this;return tmp;}
	constexpr mint_base operator--(int) noexcept
	{auto tmp = *this;--*this;return tmp;}
	constexpr mint_base operator~()const noexcept
	{return m_pow(*this, mod-2);}
	constexpr mint_base & operator=(const mint_base &other) noexcept
	{a=other.a;return *this;}
	constexpr explicit operator uint64_t()const noexcept
	{return a;}
	constexpr explicit operator int()const noexcept
	{return a;}
	constexpr explicit operator unsigned()const noexcept
	{return (unsigned)a;}
	static constexpr uint64_t getmod() noexcept
	{return mod;}
	constexpr mint_base(uint64_t a_) noexcept :a(a_ % mod) {}
	constexpr mint_base()noexcept : a(0) {}
	struct mod_value_tag {};
	constexpr mint_base(uint64_t a_, mod_value_tag) :a(a_) {}
private:
	uint64_t a;
};

//mint_base型用の累乗関数
constexpr mint_base m_pow(mint_base x,uint64_t n)noexcept
{
	mint_base res = 1;
	while(n>0){
		if(n&1){res*=x;}
		x*=x;
		n>>=1;
	}
	return res;
}
//mint_baseの階乗計算
//0からxまでの階乗を返す
//O(x)時間が必要
vector<mint_base> fla;//階乗が入る
void fla_set(mint_base x)
{
	fla.resize(((uint64_t)x)+1);
	fla[0] = 1;
	for (uint64_t i = 1; i <= (uint64_t)x;i++){fla[i]=fla[i-1]*i;}
}
vector<mint_base> gya;//~fla[i] が入る

//O(x+log mod)で求める O(xlogmod)より速い
void fla_gya_set(mint_base x)
{
	fla_set(x);
	gya.resize(((uint64_t)x)+1);
	gya[(uint64_t)x]=~fla[(uint64_t)x];
	for(uint64_t i =(uint64_t)x;i>0;i--){gya[i-1]=gya[i]*i;}
}

//mint_base型のstreamへの出力
std::ostream& operator<<(std::ostream& os, mint_base i)
{os<<(uint64_t)i;return os;}
//mint_base型のstreamからの入力
std::istream& operator >> (std::istream& is, mint_base& i)
{uint64_t tmp;is>>tmp;i=tmp;return is;}

int main(void){
	int n,i,j;cin>>n;
	if(n==1){cout<<1<<endl;return 0;}
	fla_gya_set(n);
	//dp[残り数][+数][-数]
	static mnt dp[51][51][51]={0};
	dp[n-1][1][0]=1;
	int pla,mai,res;
	for(res=n-1;res>0;res--){
		mnt ue[51]={};
		mnt st[51]={};
		dp[res][0][0]=0;
		for(pla=0;pla<=n;pla++){
			for(mai=0;mai<=n;mai++){
				if((int)dp[res][pla][mai]==0){continue;}
				for(int hen=0;hen<=pla;hen++){
					ue[hen]+=dp[res][pla][mai]*gya[pla-hen]*gya[mai+hen];
				}
				for(int hen=1;hen<=mai;hen++){
					st[hen]+=dp[res][pla][mai]*gya[mai-hen]*gya[pla+hen];
				}
			}
		}
		for(int ata=0;ata<=n;ata++){
			if((int)ue[ata]==0){continue;}
			for(int fe=0;;fe++){
				int ter=res-(ata+fe*2);
				if(ter<0){break;}
				dp[ter][ata+fe][fe]+=ue[ata];
			}
		}
		for(int ata=1;ata<=n;ata++){
			if((int)st[ata]==0){continue;}
			for(int fe=0;;fe++){
				int ter=res-(ata+fe*2);
				if(ter<0){break;}
				dp[ter][fe][ata+fe]+=st[ata];
			}
		}
	}
	mnt ans=0;
	for(pla=0;pla<=n;pla++){
		for(mai=0;mai<=n;mai++){
			ans+=dp[0][pla][mai]*gya[pla]*gya[mai];
		}
	}
	ans*=fla[n];
	cout<<ans<<endl;
	return 0;
}

Measured memory_bytes: 1280