mod = 10**9+7
class Combination:
    def __init__(self, N, mod):
        self.mod = mod
        self.fact = [0] * (N+1)
        self.factinv = [0] * (N+1)
        self.fact[0] = 1
        self.factinv[0] = 1
        for i in range(1,N+1):
            self.fact[i] = (i * self.fact[i-1]) % self.mod
            self.factinv[i] = self.bin_power(self.fact[i], self.mod - 2)

    def bin_power(self, x, k):
        ret = 1
        while k > 0:
            if k & 1:
                ret = ret * x % self.mod
            x = x * x % self.mod
            k >>= 1
        return ret

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

N = int(input())
DP = [[0] * (N+1) for _ in range(N+1)]
DP[0][0] = 1
for i in range(1,N+1):
    for j in range(1,N+1):
        if i < j:
            break
        DP[i][j] = DP[i-1][j-1] + DP[i-1][j] * j
        DP[i][j] %= mod
C = Combination(N, mod)
ans = 0
for i in range(1,N+1):
    for j in range(1,N+1):
        ans += C.comb(N, i) * DP[i][j] * pow((j-1)*j, N-i, mod)
        ans %= mod
print(ans)