mod = 10**9 + 7
n = int(input())
k = 2 * n

# Calculate (2n)! mod mod
fact = 1
for i in range(1, k + 1):
    fact = fact * i % mod

# Calculate the modular inverse of 2^n
denominator = pow(2, n, mod)
inv_denominator = pow(denominator, mod - 2, mod)

# The result is ( (2n)! * inv_denominator ) mod mod
print(fact * inv_denominator % mod)