#include<iostream>
using namespace std;
long M=1e9+7,n,x,fact[1<<17]={1},ans;
long pow(long a,long b){return b?pow(a*a%M,b/2)*(b%2?a:1)%M:1;}
main()
{
	cin>>n;
	for(;x++<n;)fact[x]=fact[x-1]*x%M;
	for(x=0;x++<n;)
	{
		ans=(ans+fact[n]*pow(fact[n-x],M-2)%M*pow(fact[x],M-2)%M*pow(x,n-x)%M)%M;
	}
	cout<<ans<<endl;
}