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

fr = 4*n
fact = [0 for i in range(fr)]
fact[0]=1
for i in range(1,fr):
    fact[i]=i*fact[i-1]%mod

def ch(a,b):
    return fact[a] * pow(fact[b], -1, mod) * pow(fact[a-b], -1, mod) % mod


out = 0
for i in range(1, (n+2)//2):
    out += (-1)**(i+1) * ch(n,i) * ch(4*(n-i), 2*n)

print(out%mod)