#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;

using Mint = atcoder::modint1000000007;

int main()
{
	int N;
	cin >> N;
	vector<vector<Mint>> S2(N + 1), C(N + 1);
	S2[0] = C[0] = {1};
	for (int i = 1; i <= N; i++)
	{
		S2[i].resize(i + 1);
		C[i].resize(i + 1);
		S2[i][0] = 0;
		S2[i][i] = 1;
		C[i][0] = C[i][i] = 1;
		for (int j = 1; j < i; j++)
		{
			S2[i][j] = j * S2[i - 1][j] + S2[i - 1][j - 1];
			C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
		}
	}
	Mint ans = 0;
	for (int i = 0; i <= N; i++)
		for (int j = 1; j <= i; j++)
			ans += S2[i][j] * C[N][i] * Mint(j * (j - 1)).pow(N - i);
	cout << ans.val() << endl;
}