M = 1000
mod = 10 ** 9 + 7
S = [[0] * M for _ in range(M)]
for i in range(1, M):
    S[i][1] = 1
    S[i][i] = 1

for n in range(3, M):
    for k in range(n):
        S[n][k] = S[n - 1][k - 1] + k * S[n - 1][k]
        S[n][k] %= mod

n = M
fact = [1] * (n + 1)
invfact = [1] * (n + 1)
for i in range(1, n):
    fact[i + 1] = ((i+1) * fact[i]) % mod
invfact[n] = pow(fact[n], mod - 2, mod)
for i in range(n - 1, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % mod

def comb(n, r):
    if n < 0 or r < 0 or n - r < 0:
        return 0
    return fact[n] * invfact[r] * invfact[n - r] % mod


N = int(input())
ans = 1
for g in range(1, N):
    for n in range(g, N + 1):
        ans += comb(N, n) * S[n][g] * pow(g * (g - 1), (N - n), mod)
        ans %= mod

print(ans)