#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
#define FOR(i, f, t)        for(int(i)=(f);(i)<(t);(++i))
const int MOD = int(1e9+7);

ll extgcd(ll a,ll b,ll &m,ll &n){ll g=a;m=1;n=0;if(b)g=extgcd(b,a%b,n,m),n-=(a/b)*m;return g;}
ll divmod(ll n,ll m,ll mod){ll a,b;extgcd(m,mod,a,b);return((n*a)%mod+mod)%mod;}

const int factmax = 2000;
ll fact[factmax+1], factinv[factmax+1];
void factmod(){
    fact[0]=fact[1]=1;
    for(int i=2;i<=factmax;i++)fact[i]=(fact[i-1]*i)%MOD;
    factinv[factmax]=divmod(1,fact[factmax],MOD); //inv
    for(int i=factmax;i>0;i--)factinv[i-1]=(factinv[i]*i)%MOD;
}
int Cmod(int n, int r){
    if(n > factmax) throw;
    if(n < r) return 0;
    return fact[n] * factinv[r] % MOD * factinv[n-r] % MOD;
}

int binpow(ll x, ll k, int m){
    if(k==0) return 1;
    if(k%2==0) return binpow(((x%m)*(x%m))%m, k/2, m);
    else return ((x%m)*binpow(x, k-1, m)) % m;
}

// n個をgグループに分ける通り数
const int grpmax = 555;
ll grpmemo[grpmax+1][grpmax+1];
ll grpmod(int n, int g){
    if(n > grpmax || g > grpmax) throw;
    if(n == 0 && g == 0) return 1;
    if(n < g || g <= 0) return 0;
    if(grpmemo[n][g] >= 0) return grpmemo[n][g];
    ll res = (grpmod(n-1, g-1) + (g * grpmod(n-1, g) % MOD)) % MOD;
    return grpmemo[n][g] = res;
}

int main(){
    memset(grpmemo, -1, sizeof(grpmemo));
    factmod();
    int N; cin >> N;
    
    ll res = 0;
    for(int g = 1; g <= N; g++){
        for(int p = 0; p <= N; p++){
            ll k = Cmod(N, p) * grpmod(p, g) % MOD;
            k = k * binpow(g*(g-1)%MOD, N-p, MOD) % MOD;
            res = (res + k) % MOD;
        }
    }
    cout << res << endl;
    return 0;
}