#include <cassert>
#include <iostream>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int mod = 1e9 + 7;

template <uint MD>
struct ModInt {
    using M = ModInt;
    const static M G;
    uint v;
    ModInt(ll _v = 0) { set_v(_v % MD + MD); }
    M& set_v(uint _v) {
        v = (_v < MD) ? _v : _v - MD;
        return *this;
    }
    explicit operator bool() const { return v != 0; }
    M operator-() const { return M() - *this; }
    M operator+(const M& r) const { return M().set_v(v + r.v); }
    M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
    M operator*(const M& r) const { return M().set_v(ull(v) * r.v % MD); }
    M operator/(const M& r) const { return *this * r.inv(); }
    M& operator+=(const M& r) { return *this = *this + r; }
    M& operator-=(const M& r) { return *this = *this - r; }
    M& operator*=(const M& r) { return *this = *this * r; }
    M& operator/=(const M& r) { return *this = *this / r; }
    bool operator==(const M& r) const { return v == r.v; }
    bool operator!=(const M& r) const { return !(v == r.v); }
    M pow(ll n) const {
        M x = *this, r = 1;
        while (n) {
            if (n & 1)
                r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    M inv() const { return pow(MD - 2); }
    friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
    friend istream& operator>>(istream& is, M& r) { return is >> r.v; }
};
using Mint = ModInt<mod>;

Mint memo_stirling[1000][1000];
bool seen_stirling[1000][1000];
Mint stirlign(int n, int k) {
    if (n == 0 && k == 0) return Mint{1};
    if (seen_stirling[n][k])
        return memo_stirling[n][k];
    Mint ret = 0;
    if (n >= 1) {
        ret += stirlign(n - 1, k) * k;
        if (k >= 1) {
            ret += stirlign(n - 1, k - 1);
        }
    }
    seen_stirling[n][k] = 1;
    return memo_stirling[n][k] = ret;
}
const int MN = 1000000;
Mint fact[MN], iFac[MN];
void first() {
    fact[0] = Mint(1);
    for (int i = 1; i < MN; i++)
        fact[i] = fact[i - 1] * Mint(i);
    iFac[MN - 1] = fact[MN - 1].inv();
    for (int i = MN - 1; i >= 1; i--) {
        iFac[i - 1] = iFac[i] * Mint(i);
    }
    assert(fact[2345] * iFac[2345] == Mint(1));
}
Mint C(int n, int k) {
    if (n < k || k < 0)
        return Mint(0);
    return fact[n] * iFac[k] * iFac[n - k];
}

int main() {
    first();
    int N;
    cin >> N;

    Mint ans = 0;

    for (int group = 1; group <= N; group++) {
        for (int i = group; i <= N; i++) {
            Mint tmp = stirlign(i, group) * C(N, i);
            for (int j = 0; j < N - i; j++) {
                tmp *= group * (group - 1);
            }
            ans += tmp;
        }
    }
    cout << ans << endl;
}