#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 100010, mod = 1e9 + 7;

int n;
int fac[N], invfac[N];

int qmi(int a, int b)
{
	int res = 1;
	while (b)
	{
		if (b & 1) res = res * a % mod;
		a = a * a % mod, b >>= 1;
	}
	return res;
}

void init()
{
	fac[0] = invfac[0] = 1;
	for (int i = 1; i < N
	; i ++ )
	{
		fac[i] = fac[i - 1] * i % mod;
		invfac[i] = invfac[i - 1] * qmi(i, mod - 2) % mod;
	}
}

int C(int a, int b)
{
	if (a < 0 || b < 0 || a < b) return 0;
	return fac[a] * invfac[a - b] % mod * invfac[b] % mod;
}

signed main()
{
	init();
	cin >> n;
	int res = 0;
	for (int i = 1; i <= n; i ++ ) res = (res + C(n, i) * qmi(i, n - i) % mod) % mod;
	cout << res << "\n"; 
	return 0;
}