#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { ll B, T, F, P; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int INF = INT_MAX / 10;

int main() {
	int N; cin >> N;
	vector< vector<ll> > dp(1200, vector<ll>(1200));
	dp[0][0] = 1;
	for (int i = 0; i < N; i++) {
		vector< vector<ll> > _dp(1200, vector<ll>(1200));
		for (int i = 0; i < 1200; i++)
			for (int j = 0; j < 1200; j++) {
				ll& x = dp[i][j];
				if (x == 0) continue;
				_dp[i][j] = (_dp[i][j] + x * i + x * (i + j) * (i + j - 1)) % MOD;
				if (j) _dp[i + 1][j - 1] = (_dp[i + 1][j - 1] + x * j) % MOD;
				_dp[i + 1][j] = (_dp[i + 1][j] + x) % MOD;
				_dp[i][j + 1] = (_dp[i][j + 1] + x * i * 2 + x * j * 2) % MOD;
				_dp[i][j + 2] = (_dp[i][j + 2] + x) % MOD;
			}
		dp = _dp;
	}
	ll ans = 0;
	for (int i = 1; i < 1200; i++)
		ans = (ans + dp[i][0]) % MOD;
	cout << ans << endl;
}