import math

def factorial(x, mod):
    sum = 1
    for i in range(1, x+1):
        sum = (sum * i) % mod

    return int(sum)

def comb(n, k, mod):
    f1 = factorial(k,mod)
    f2 = factorial(n-k,mod)
    arg = (f1 * f2) % mod
    return  (factorial(n,mod) * pow(arg,-1,mod=mod)) % mod

if __name__ == "__main__":
    n = int(input())

    mod = 1000000000 + 7
    res = (n * comb(4*n-4,2*n,mod))% mod
    k = (2*n - 4) // 4
    for i in range(1,k+1):
        res = (res - comb(n,i+1, mod) * i)% mod
    print(res)