def solve(N):
    '''
    dp[0][k]: 低高低高... が k 個続くパターンの数
    dp[1][k]: 高低高低... が k 個続くパターンの数
    dp[0][0] = 1
    dp[1][0] = 1
    dp[0][1] = 1
    dp[1][1] = 1
    dp[0][N] = sum(nCb(N - 1, k) * dp[0][k] * dp[0][N - k - 1] for k in range(1, N, 2))
    dp[1][N] = sum(nCb(N - 1, k) * dp[1][k] * dp[0][N - k - 1] for k in range(0, N, 2))
    a[N] = sum(nCb(N - 1, k) * a[k] * a[N - k - 1] for k in range(1, N, 2))
    b[N] = sum(nCb(N - 1, k) * b[k] * a[N - k - 1] for k in range(0, N, 2))
    
    nCb[n][k] = nCb[n-1][k-1] + nCb[n][k]
    nCb[n][0] = 1
    nCb[n][n] = 1
    '''
    if N <= 2:
        return 0
    mod = 10**9 + 7
    a = [0] * (N + 1)
    b = [0] * (N + 1)
    a[0] = 1
    a[1] = 1
    b[0] = 1
    b[1] = 1
    nCb = [1]
    for n in range(1, N):
        update_nCb(nCb)
        a[n + 1] = sum(nCb[k] * a[k] * a[n - k] for k in range(1, n+1, 2)) % mod
        b[n + 1] = sum(nCb[k] * b[k] * a[n - k] for k in range(0, n+1, 2)) % mod
    return (a[N] + b[N]) % mod

def update_nCb(nCb):
    mod = 10**9 + 7
    nCb.append(0)
    for i in range(len(nCb) - 1, 0, -1):
        nCb[i] += nCb[i - 1]
        nCb[i] %= mod

N = int(input())
print(solve(N))