#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;

ll dp[2][600][600];
ll ans[600];

void add(ll& a, ll b){
	a += b % MOD;
	a %= MOD;
}

void dp_solver(){
	const int n = 555;
	int curr = 0, next = 1;

	memset(dp[curr], 0 ,sizeof(dp[curr]));
	dp[curr][0][0] = 1;

	for(int use=0;use<n;use++){
		memset(dp[next], 0, sizeof(dp[next]));

		int rem = n - use;
		for(int ok=0;ok<=use;ok++){
			for(int ng=0;ng<=rem;ng++){
				ll now = dp[curr][ok][ng];
				if(now == 0)
					continue;

				add(dp[next][ok+1][ng], now);
				add(dp[next][ok][ng+2], now);

				if(ok > 0)
					add(dp[next][ok][ng], now * ok * ok);

				if(ng > 1)
					add(dp[next][ok][ng], now * ng * (ng - 1));

				if(ng > 0)
					add(dp[next][ok+1][ng-1], now * ng);

				if(ok > 0 && ng > 0)
					add(dp[next][ok][ng], now * ok * ng * 2);

				if(ok > 0)
					add(dp[next][ok][ng+1], now * ok * 2);

				if(ng > 0)
					add(dp[next][ok][ng+1], now * ng * 2);
			}
		}

		swap(curr, next);

		ll res = 0;
		for(int ok=0;ok<=use+1;ok++)
			add(res, dp[curr][ok][0]);

		ans[use+1] = res;
	}
}

int main(){
	dp_solver();

	int n; cin >> n;
	cout << ans[n] << endl;

	return 0;
}