#include <bits/stdc++.h>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) noexcept { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

template <class Mint>
struct combination {
   private:
    std::vector<Mint> _fact, _ifac;
    void expand(size_t N) {
        const size_t a = _fact.size();
        if(a > N) return;
        _fact.resize(N + 1);
        for(size_t i = a; i <= N; i++) _fact[i] = _fact[i - 1] * i;
        _ifac.resize(N + 1);
        _ifac[N] = Mint{1} / _fact[N];
        for(size_t i = N; i > a; i--) _ifac[i - 1] = _ifac[i] * i;
    }

   public:
    combination(size_t N = 0) : _fact(1, 1), _ifac(1, 1) {
        expand(N);
    }
    Mint fact(size_t x) {
        expand(x);
        return _fact[x];
    }
    Mint invfact(size_t x) {
        expand(x);
        return _ifac[x];
    }
    Mint perm(size_t N, size_t K) {
        if(N < K) return Mint{0};
        expand(N);
        return _fact[N] * _ifac[N - K];
    }
    Mint comb(size_t N, size_t K) {
        if(N < K) return Mint{0};
        expand(N);
        return _fact[N] * _ifac[K] * _ifac[N - K];
    }
    Mint homo(size_t N, size_t K) {
        if(N == 0) return K == 0 ? Mint{1} : Mint{0};
        return comb(N - 1 + K, K);
    }
};

#include <atcoder/modint>
using mint = atcoder::modint1000000007;
combination<mint> C;
void run_case() {
    int N;
    cin >> N;
    mint ans = 0;
    rep(f, 1, N + 1) {
        ans += C.comb(N, f) * mint::raw(f).pow(N - f);
    }
    cout << ans .val() << "\n";
}
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    while (T--) run_case();
    return 0;
}