N = int(input())
mod = 1000000007

def invmod(a,mod):#mod逆元
    if a == 0:
        return 0
    if a == 1:
        return 1
    return (-invmod(mod % a, mod) * (mod // a)) % mod

inv2 = invmod(2,mod)

ans = 1

for i in range(1,2*N+1):
    ans *= i
    ans %= mod

for i in range(N):
    ans *= inv2
    ans %= mod

print(ans)