import sequtils,strutils,strscans

proc powInt(n : int64, m : int64, k = 1_000_000_007):int64 =
    if m == 0:
        return 1
    elif m == 1:
        return (n mod k)
    if (m mod 2) == 0:
        return powInt((n * n) mod k,m div 2, k) mod k
    else:
        return (powInt((n * n) mod k,m div 2, k) * n) mod k

const
    Max_num = 100_003
    m : int64 = 1_000_000_007

var
    kaizyou : array[Max_num + 1, int64]
    gyakuKaizyou : array[Max_num + 1, int64]
kaizyou[0] = 1

for i in 1..Max_num:
    kaizyou[i] = ((kaizyou[i - 1] * i.int64) mod m)
gyakuKaizyou[Max_num] = powInt(kaizyou[Max_num], 1_000_000_005, 1_000_000_007)

for i in countdown(Max_num - 1,0):
    gyakuKaizyou[i] = (gyakuKaizyou[i + 1] * (i + 1)) mod m

proc combination(n : int64, k : int64): int64 =
    if n < k:
        return 0
    if n == k:
        return 1
    return (((kaizyou[n] * gyakuKaizyou[n - k]) mod m) * gyakuKaizyou[k]) mod m

var
    N = stdin.readline.parseInt
    ans : int64
    
for p in 1..N:
    ans = (ans + combination(N, p) * powInt(p, N - p)) mod m

echo ans