#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

ll N;

template <typename T>
T expt(T a, T n, T mod = std::numeric_limits<T>::max()){
    T res = 1;
    while(n){
        if(n & 1){res = res * a % mod;}
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

template <typename T>
T inverse(T n, T mod){
    return expt(n, mod-2, mod);
}

template <typename T>
struct Combination{
    T mod;
    std::vector<T> fact, inv;

    Combination() = default;
    Combination(int max_n, T mod) : mod(mod) {
        fact = std::vector<T>(max_n);
        inv = std::vector<T>(max_n);
        
        fact[0] = 1;
        inv[0] = 1;

        for(int i=1;i<max_n;i++){
            fact[i] = fact[i-1] * i % mod;
            inv[i] = inverse(fact[i], mod);
        }        
    }
    Combination(Combination const &) = default;
    Combination(Combination&&) = default;
    Combination& operator=(Combination const &) = default;
    Combination& operator=(Combination&&) = default;
    
    T nPr(T n, T r){
        if(n < r){return 0;}
        return fact[n] * inv[r] % mod;
    }

    T nCk(T n, T k){
        if(n < k){return 0;}
        return fact[n] * inv[k] % mod * inv[n-k] % mod;
    }

    T nHk(T n, T k){
        if(n == 0 && k == 0){return 1;}
        return nCk(n+k-1, k);
    }
};

const ll MOD = 1e9 + 7;

Combination<ll> combination(200100, MOD);

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N;

    ll res = 0ll;
    for(int i=1;i<=N;++i){
        res = (res + combination.nCk(N, i) * expt<ll>(i, N - i, MOD) % MOD) % MOD;
    }

    std::cout << res << std::endl;
}