#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;

int const MOD = 1e9+7;

int main() {

  ll N; cin >> N;
  vector<vector<ll>> dp(600, vector<ll>(600));

  REP(i, 1, 600) {
    dp[i][1] = 1;
    REP(j, 2, 600) {
      (dp[i][j] = dp[i-1][j-1] + j*dp[i-1][j]) %= MOD;
    }
  }

  vector<vector<ll>> comb(600, vector<ll>(600));
  rep(i, 600) {
    comb[i][0] = 1;
    REP(j, 1, i+1) {
      (comb[i][j] = comb[i-1][j] + comb[i-1][j-1]) %= MOD;
    }
  }

  // (i*(i-1)) ^ j を計算
  vector<vector<ll>> prepow(600, vector<ll>(600));
  rep(i, 600) {
    prepow[i][0] = 1;
    rep(j, 600) {
      (prepow[i][j+1] = prepow[i][j] * i*(i-1)) %= MOD;
    }
  }

  ll ans = 0;
  REP(i, 1, N+1) REP(j, 1, i+1) {
    (ans += comb[N][i] * dp[i][j] % MOD * prepow[j][N-i] % MOD) %= MOD;
  }

  cout << ans << endl;

  return 0;
}