#include <iostream>

#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()

using namespace std;

using ll =  long long;

constexpr ll MOD = 1000000007;
constexpr int N_MAX = 556;

ll fact[N_MAX], rfact[N_MAX];

ll perm(ll n, ll r){
    return (fact[n] * rfact[r]) % MOD;
}

ll comb(ll n, ll r){
    return (perm(n, r) * rfact[n-r]) % MOD;
}

void init(ll n){
    fact[0] = fact[1] = 1;
    rfact[0] = rfact[1] = 1;
    for(int i=2;i<=n;++i) {
        fact[i] = (fact[i-1] * (ll)i) % MOD;
        rfact[i] = 1;
        ll k = MOD-2;
        ll a = fact[i];
        while(k > 0){
            if(k & 1){
                rfact[i] *= a;
                rfact[i] %= MOD;
            }
            a *= a;
            a %= MOD;
            k  >>= 1;
        }
    }
}

class Stirling {
    public:
    int n, m; // ボールの個数，グループ数
    ll s[2*N_MAX][N_MAX];
    Stirling(int n, int m, bool is_the_second_kind=true): n(n), m(m) {
        if(is_the_second_kind) {
            for(int i=0;i<=n;++i) {
                s[i][0] = (i == 0)?1:0;
                if(i == 0) continue;
                for(int j=1;j<=m;++j) {
                    s[i][j] = (s[i-1][j-1] + (s[i-1][j]*j) % MOD) % MOD;
                }
            }
        }
    }

    ll get(int i, int j) {
        return s[i][j];
    }
};

ll modpow(ll a, ll t) {
    ll ret = 1LL;
    while(t){
        if(t & 1LL){
            ret *= a;
            ret %= MOD;
        }
        a *= a;
        a %= MOD;
        t >>= 1;
    }
    return ret;
}

int main() {
    ll n;
    cin >> n;
    init(n);
    Stirling s = Stirling(n, n);

    ll ans = 0LL;
    for(ll x=1;x<=n;++x) {
        for(ll y=1;y<=x;++y) {
            ans += (((comb(n, x) * s.get(x, y)) % MOD) * modpow((y * (y-1)) % MOD, n-x)) % MOD;
            ans %= MOD;
        }
    }
    cout << ans << endl;
}