// yukicoder: 140 みんなで旅行
// 2019.8.7 bal4u

#include <stdio.h>

typedef long long ll;

#define MOD 1000000007
#define MAX 560
int fact[MAX], inv[MAX], factinv[MAX];
int com[MAX][MAX];
int stir[MAX][MAX];

int comb(int n, int k) {
	if (n < 0 || k < 0) return 0;
	if (com[n][k]) return com[n][k];
	return com[n][k] = (int)((ll)fact[n] * factinv[k] % MOD * factinv[n-k] % MOD);
}

// テーブルを作る前処理
void COMinit(int max)
{
	fact[0] = fact[1] = 1;
	factinv[0] = factinv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i <= max; i++) {
		fact[i] = (ll)fact[i - 1] * i % MOD;
		inv[i] = MOD - (ll)inv[MOD % i] * (MOD / i) % MOD;
		factinv[i] = (ll)factinv[i - 1] * inv[i] % MOD;
	}
}

int powmod(int b, int p)
{
   int r = 1;
   while (p) {
      if (p & 1) r = (ll)r * b % MOD;
      b = (ll)b * b % MOD;
	  p >>= 1;
   }
   return r;
}

int main()
{
	int i, j, N, ans;
	
	scanf("%d", &N);
	COMinit(N);
	
	// スターリング数
    stir[0][0] = 1;
    for (i = 1; i <= N; i++) for (j = 1; j <= i; j++)
		stir[i][j] = (stir[i-1][j-1] + (ll)j*stir[i-1][j]) % MOD;

	ans = 0;
	for (i = 1; i <= N; i++) for (j = 1; j <= i; j++) {
		ans = ans + (ll)comb(N, i)*stir[i][j] % MOD * powmod(j*(j-1), N-i) % MOD;
		if (ans >= MOD) ans -= MOD;
    }
    printf("%d\n", ans);
    return 0;
}