SIZE=1000; MOD=10**9+7 #998244353 #ここを変更する

inv = [0]*SIZE  # inv[j] = j^{-1} mod MOD
fac = [0]*SIZE  # fac[j] = j! mod MOD
finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE):
    fac[i] = fac[i-1]*i%MOD
finv[-1] = pow(fac[-1],MOD-2,MOD)
for i in range(SIZE-1,0,-1):
    finv[i-1] = finv[i]*i%MOD
    inv[i] = finv[i]*fac[i-1]%MOD

def choose(n,r): # nCk mod MOD の計算
    if 0 <= r <= n:
        return (fac[n]*finv[r]%MOD)*finv[n-r]%MOD
    else:
        return 0

def f(g): # g組作る
    r = 0
    for k in range(g,n+1): # k夫婦同一、n-k ちがう 
        r += bell[k][g]*choose(n,k)%MOD*pow(g*(g-1),n-k,MOD)%MOD
    return r

n = int(input())
ans = 0
MOD = 10**9+7

bell = [[1]]
dp = [1]
for i in range(n):
    ndp = [0]+dp[:]
    for j in range(1,i+1):
        ndp[j] += j*dp[j]
        ndp[j] %= MOD
    dp = ndp
    bell.append(dp)
for g in range(1,n+1):
    ans += f(g)
print(ans%MOD)