#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000000000000

int main(){
	
	int N;
	cin>>N;
	
	vector dp(1,vector<mint>(1,0));
	dp[0][0] = 1;
	
	rep(i,N){
		vector ndp(i+2,vector<mint>((i+1)*2+1,0));
		
		rep(j,dp.size()){
			rep(k,dp[j].size()){
				if(dp[j][k]==0)continue;
				ndp[j+1][k] += dp[j][k];
				if(k!=0){
					ndp[j+1][k-1] += dp[j][k]*k;
				}
				ndp[j][k] += dp[j][k]*j*j;
				ndp[j][k] += dp[j][k]*k*(k-1);
				ndp[j][k+1] += dp[j][k] * (j+k) * 2;
				ndp[j][k] += dp[j][k] * j * k * 2;
				ndp[j][k+2] += dp[j][k];
				
			}
		}
		swap(dp,ndp);
	}
	
	mint ans = 0;
	rep(i,dp.size())ans += dp[i][0];
	cout<<ans.val()<<endl;
	
	return 0;
}