#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
//~ const ll mod = 998244353;
const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 1200;

ll inv[N], fac[N], ifac[N];
ll binom(int n, int m) {
	if(n < m || m < 0) return 0; // n >= 0
	return fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}

ll f[2][N][N];
// f[first i couples][legal groups][illegal groups]

void upd(ll &a, ll b) {
	a += b;
	a %= mod;
}

int main() {
	inv[1] = fac[0] = ifac[0] = 1;
	for(int i = 2; i < N; i ++)
		inv[i] = (mod - mod / i) * inv[mod % i] % mod;
	for(int i = 1; i < N; i ++) {
		fac[i] = i * fac[i - 1] % mod;
		ifac[i] = inv[i] * ifac[i - 1] % mod;
	}
	ios :: sync_with_stdio(false);
	
	int n; cin >> n;
	f[0][0][0] = 1;
	
	int now = 0;
	for(int i = 1; i <= n; i ++) {
		int nxt = now ^ 1;
		memset(f[nxt], 0, sizeof f[nxt]);
		for(int j = 0; j <= n; j ++)
			for(int k = 0; k <= 2 * n; k ++) if(f[now][j][k]) {
				ll x = f[now][j][k];
				upd(f[nxt][j][k], (j + k) * (j + k - 1) * x);
				if(k) upd(f[nxt][j + 1][k - 1], k * x);
				upd(f[nxt][j][k], j * x);
				
				upd(f[nxt][j][k + 1], 2 * (j + k) * x);
				
				upd(f[nxt][j + 1][k], x);
				upd(f[nxt][j][k + 2], x);
			}
		
		now = nxt;
	}
	
	ll ans = 0;
	for(int i = 1; i <= n; i ++)
		upd(ans, f[now][i][0]);
	cout << ans << '\n';
}