#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
T chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
T chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") { cout << (f ? yes : no) << "\n"; }

template <class mint>
struct Comb {
    const int N;
    vector<mint> fact;
    vector<mint> ifact;
    Comb(int n) : N(n + 1), fact(n + 1), ifact(n + 1) { makeFact(); }
    void makeFact() {
        fact[0] = ifact[0] = 1LL;
        for (int i = 1; i < N; i++) {
            fact[i] = fact[i - 1] * (mint)i;
            ifact[i] = fact[i].inv();
        }
    }
    mint operator()(int n, int r) {
        if (n < 0 || r < 0 || r > n) return 0;
        if (r > n / 2) r = n - r;
        return fact[n] * ifact[n - r] * ifact[r];
    }
};

void solve() {
    int n;
    cin >> n;
    using mint = modint1000000007;
    Comb<mint> c(n * 2 + 10);
    vector dp(n + 2, vector(n + 2, mint(0)));
    REP(i, 1, n + 1) {
        dp[i][1] = 1;
        REP(j, 2, i + 1) {
            dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j] * j;
        }
    }
    vector ep(n + 2, vector(n + 2, mint(0)));
    rep(i, n + 1) {
        ep[i][0] = 1;
        rep(j, n + 1) {
            ep[i][j + 1] += ep[i][j] * (i * (i - 1));
        }
    }
    mint ans = 0;
    REP(i, 1, n + 1)
    REP(j, 1, n + 1) {
        ans += c(n, i) * dp[i][j] * ep[j][n - i];
    }
    cout << ans.val() << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // multi-testcase
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}