MOD = 10**9 + 7

K = int(input())

if K % 2 != 0:
    print(0)
else:
    M = K // 2
    n = K - 1
    k = M - 1

    # Compute factorial and inverse factorial using precomputation up to n (if feasible)
    def compute_comb(n, k, MOD):
        if k < 0 or k > n:
            return 0
        numerator = 1
        denominator = 1
        for i in range(1, k + 1):
            denominator = denominator * i % MOD
        for i in range(n - k + 1, n + 1):
            numerator = numerator * i % MOD
        return numerator * pow(denominator, MOD - 2, MOD) % MOD

    result = compute_comb(n, k, MOD)
    print((2 * result) % MOD)