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

typedef long long ll;
typedef pair<ll,ll> pll;

#define mp make_pair

ll mod=1000000007;

template <typename argT,typename retT> function<retT(argT)> memo(function<retT(argT)>f){
    map<argT,retT> m;
    return [=](argT n) mutable -> retT {
        return (m.find(n) != m.end()) ? m[n] : (m[n] = f(n));
    };
}

function<ll(pll)> combination_len = memo<pll,ll>(
    [&](pll arg)->ll{
        ll n=arg.first, k=arg.second;
        if ( k == 0 || n == k ){ return 1; }
        return (combination_len(mp(n-1,k-1))+combination_len(mp(n-1,k)))%mod;
    }
);

function<ll(pll)> p = memo<pll,ll>(
    [&](pll arg)->ll{
        ll n=arg.first, k=arg.second;
        if ( k == 1 ){ return 1; }
        if ( n == 1 ){ return 0; }
        return (p(mp(n-1,k-1))+k*p(mp(n-1,k)))%mod;
    }
);

function<ll(pll)> q = memo<pll,ll>(
    [&](pll arg)->ll{
        ll n=arg.first, k=arg.second;
        if ( k == 0 ){ return 1; }
        return q(mp(n,k-1))*n%mod*(n-1)%mod;
    }
);

int main(){
    ll n,ans;
    cin>>n;
    ans=0;
    for(ll i=1;i<=n;i++){
        for(ll j=1;j<=i;j++){
            ans = (ans + combination_len(mp(n,i)) * p(mp(i,j)) % mod * q(mp(j,n-i)) ) % mod;
        }
    }
    cout<<ans<<endl;
    return 0;
}