#卡特兰数

def qmi(a,k,p):
    res = 1
    while k:
        if k & 1: res = res * a % p
        a = a * a % p
        k >>= 1
    return res

if __name__ == "__main__":
    mod = int(1e9+7)
    n = int(input())

    a, b = n*2, n
    res = 1

    for i in range(a,a-b,-1): res = res * i % mod

    for i in range(1,b+1): res = res * qmi(i,mod-2,mod) % mod

    res = res * qmi(n+1,mod-2,mod) % mod

    print(res)