#include #define endl '\n' #define int long long #define lint long long #define pii pair #define FOR(i, a, b) for(int i = (a); i < (b); ++i) #define FORR(i, a, b) for(int i = (a); i > (b); --i) #define REP(i, n) FOR(i, 0, n) #define SZ(v) ((int)v.size()) #define ZERO(a) memset(a, 0, sizeof(a)) #define MINUS(a) memset(a, 0xff, sizeof(a)) #define FILLINF(a) memset(a, 0x3f, sizeof(a)) #define POW(n) (1LL << (n)) #define POPCNT(n) (__builtin_popcount(n)) #define IN(i, a, b) ((a) <= (i) && (i) <= (b)) using namespace std; template inline bool CHMIN(T& a,T b) { if(a > b) { a = b; return 1; } return 0; } template inline bool CHMAX(T& a,T b) { if(a < b) { a = b; return 1; } return 0; } template inline void SORT(T& a) { sort(begin(a), end(a)); } template inline void REV(T& a) { reverse(begin(a), end(a)); } template inline void UNI(T& a) { sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); } template inline T LB(S& v, T a) { return *lower_bound(begin(v), end(v), a); } template inline int LBP(S& v, T a) { return lower_bound(begin(v), end(v), a) - begin(v); } template inline T UB(S& v, T a) { return *upper_bound(begin(v), end(v), a); } template inline int UBP(S& v, T a) { return upper_bound(begin(v), end(v), a) - begin(v); } template ostream& operator << (ostream& os, const pair& p) { os << p.first << " " << p.second; return os; } template istream& operator >> (istream& is, pair& p) { is >> p.first >> p.second; return is; } template ostream& operator << (ostream& os, const vector& v) { for (int i = 0; i < v.size(); ++i) { if (i) os << " "; os << v[i]; } return os; } template istream& operator >> (istream& is, vector& v) { for(T& in : v) is >> in; return is; } template vector make_v(size_t a) { return vector(a); } template auto make_v(size_t a, Ts... ts) { return vector(ts...))>(a,make_v(ts...)); } template typename enable_if::value == 0>::type fill_v(T &t, const V &v) { t = v; } template typename enable_if::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } const double PI = 3.14159265358979323846; const double EPS = 1e-10; const lint INF = 0x3f3f3f3f3f3f3f3f; const lint MOD = 1000000007; template class Combination { vector inv, fac, finv; void init(int n) { inv[1] = 1; fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; for (int i = 2; i <= n; ++i) { inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD; fac[i] = fac[i - 1] * i % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } public: Combination(int n) : inv(n + 1), fac(n + 1), finv(n + 1) { init(n); } long long P(int n, int k) { if (n < k || n < 0 || k < 0) return 0; return fac[n] * finv[n - k] % MOD; } long long C(int n, int k) { if (n < k || n < 0 || k < 0) return 0; return fac[n] * finv[k] % MOD * finv[n - k] % MOD; } long long H(int n, int k) { if (n < 0 || k < 0) return 0; return C(n + k - 1, k); } }; // O(log n) time long long mod_pow(long long a, long long n, long long m) { a %= m; if (a < 0) a += m; long long res = 1; while (n > 0) { if (n & 1) res = res * a % m; a = a * a % m; n >>= 1; } return res; } int N; void _main() { cin >> N; Combination C(100000); int ans = 0; FOR (k, 1, N + 1) { (ans += C.C(N, k) * mod_pow(k, N - k, MOD) % MOD) %= MOD; } cout << ans << endl; } signed main(signed argc, char **argv) { if (argc > 1) { if (strchr(argv[1], 'i')) freopen("input.txt", "r", stdin); if (strchr(argv[1], 'o')) freopen("output.txt", "w", stdout); } ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(10); _main(); return 0; }