#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 <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 { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

ll A[600][600], B[600][600], C[600][600];

int main() {
	A[0][0] = 1;
	for (int i = 1; i < 600; i++)
		for (int j = 1; j <= i; j++)
			A[i][j] = (A[i - 1][j - 1] + A[i - 1][j] * j) % MOD;

	for (int j = 1; j < 600; j++) {
		B[0][j] = 1;
		for (int i = 1; i < 600; i++)
			B[i][j] = B[i - 1][j] * j * (j - 1) % MOD;
	}

	for (int i = 0; i < 600; i++) {
		C[i][0] = 1;
		for (int j = 1; j <= i; j++)
			C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
	}

	int N; cin >> N;
	ll ans = 0;
	for (int i = 1; i <= N; i++)
		for (int j = 1; j <= i; j++)
			ans += C[N][i] * A[i][j] % MOD * B[N - i][j] % MOD;
	cout << ans % MOD << endl;
}