/* -*- coding: utf-8 -*-
 *
 * 140.cc: No.140 みんなで旅行 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 555;
const int MAX_N2 = MAX_N * 2;

typedef long long ll;
const ll MOD = 1000000007;

/* typedef */

/* global variables */

ll combs[MAX_N2 + 1][MAX_N2 + 1];
ll fs[MAX_N + 1][MAX_N + 1];

/* subroutines */

ll powmod(ll a, int n) {  // a^n % MOD
  ll pm = 1;
  while (n > 0) {
    if (n & 1) pm = (pm * a) % MOD;
    a = (a * a) % MOD;
    n >>= 1;
  }
  return pm;
}

/* main */

int main() {
  int n;
  cin >> n;
  int n2 = n * 2;

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

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

  ll sum = 0;
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= i; j++)
      sum =
	(sum +
	 combs[n][i] * fs[i][j] % MOD *
	 powmod((ll)j * (j - 1) % MOD, n - i) % MOD) % MOD;

  printf("%lld\n", sum);
  return 0;
}