n = int(input())
ans = 1
mod = int(1e9 + 7)
fact = [1] * 5 * n

for i in range(2, len(fact)):
    fact[i] = (fact[i - 1] * i) % mod

dp = [0] * n

def f(k): 
    if k > n//2:
        return 0
    ans = fact[4 * (n - k)] * pow(fact[2 * n - 4 * k], -1 , mod) * pow(fact[2 * n], -1, mod)
    ans %= mod
    ans *= fact[n] * pow(fact[k], -1, mod) * pow(fact[n - k], -1, mod)
    ans %= mod
    return ans

res = 0
for i in range(1, n//2+1):
    if i % 2 == 0:
        res -= f(i)
    else:
        res += f(i)
    res %= mod
# 
# for i in range(1, n+1):
    # print(f"f({i}) = {f(i)}")

print(res)

# res = f(1)
# for i in range(2, n/2+1)


# ans = n * fact[4 * n - 4] * pow(fact[2 * n - 4], -1 , mod) * pow(fact[2 * n], -1, mod)
# ans %= mod


# print(ans)