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

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

const int MOD7 = ( int ) 1e9 + 7;
const int MAXN = 555;

int N;

void init(){
  cin >> N;
}

int C[ MAXN + 10 ][ MAXN + 10 ];
int dp[ MAXN + 10 ][ MAXN + 10 ];

void preprocess(){
  C[ 0 ][ 0 ] = 1;
  for( int i = 0; i < N; ++i ){
    for( int j = 0; j <= i; ++j ){
      ( C[ i + 1 ][ j ] += C[ i ][ j ] ) %= MOD7;
      ( C[ i + 1 ][ j + 1 ] += C[ i ][ j ] ) %= MOD7;
    }
  }
  dp[ 0 ][ 0 ] = 1;
  for( int i = 0; i < N; ++i ){
    for( int j = 0; j <= N; ++j ){
      ( dp[ i + 1 ][ j + 1 ] += dp[ i ][ j ] ) %= MOD7;
      ( dp[ i + 1 ][ j ] += 1LL * dp[ i ][ j ] * j % MOD7 ) %= MOD7;
    }
  }
}

void solve(){
  int ans = 0;
  for( int i = 1; i <= N; ++i ){
    for( int j = 1; j <= N; ++j ){
      int res = 1;
      for( int k = 0; k < N - i; ++k ){
        res = 1LL * res * j % MOD7 * ( j - 1 ) % MOD7;
      }
      ( ans += 1LL * C[ N ][ i ] * dp[ i ][ j ] % MOD7 * res % MOD7 ) %= MOD7;
    }
  }
  cout << ans << endl;
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}