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

const long long int MOD = 1e9 + 7;
long long int f[200001];
long long int invf[200001];
long long int mypow(long long int x,long long int n)
{
    long long int res = 1;
    while(n>0)
    {
        if(n%2==1)
        {
            res*=x;
            res%=MOD;
        }
        x*=x;
        x%=MOD;
        n/=2;
    }
    return res;
}

//  Sum_{k=0..n} C(n,k)*(n-k)^k

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;

    f[0] = 1;
    for(int i=1;i<=200000;i++)
    {
        f[i] = f[i-1];
        f[i]*=i;
        f[i]%=MOD;
    }
    invf[200000] = mypow(f[200000],MOD-2);
    for(int i=199999;i>=0;i--)
    {
        invf[i] = invf[i+1];
        invf[i]*=(i+1);
        invf[i]%=MOD;
    }

    long long int res = 0;

    cin >> n;

    for(int k=0;k<=n;k++)
    {
        long long int val = mypow(n-k,k);
        long long int way = f[n];
        way*=invf[k];
        way%=MOD;
        way*=invf[n-k];
        way%=MOD;
        way*=val;
        way%=MOD;
        res += way;
        res%=MOD;
    }
    
    cout << res << '\n';
    return 0;
}