// yukicoder: No.573 a^2[i] = a[i]
// 2019.7.6 bal4u

#include <stdio.h>

typedef long long ll;
#define M   1000000007
#define MAX 100000

int fact[MAX+2], inv[MAX+2], factinv[MAX+2];

ll comb(int n, int k) {
    return (ll)fact[n] * factinv[k] % M * factinv[n-k] % M;
}

int bigPow(int a, int p) {
	ll r = 1;
	while (p) {
		if (p & 1) r = r * a % M;
		a = (ll)a * a % M;
		p >>= 1;
	}
	return (int)r;
}

int main()
{
	int i, N;
	ll ans;

	scanf("%d", &N);
	fact[0] = fact[1] = 1; inv[1] = 1; factinv[0] = factinv[1] = 1;
	for (i = 2; i <= N; i++) {
		fact[i] = (ll)fact[i-1] * i % M;
		inv[i] = -(M/i) * (ll)inv[M % i] % M;
		factinv[i] = (ll)factinv[i-1] * inv[i] % M;
	}

	ans = 0;
    for (i = 0; i <= N; i++) ans += comb(N, i) * bigPow(N-i, i) % M;
    ans %= M; if (ans < 0) ans += M;
    printf("%d\n", (int)ans);
}