MOD = 1000000007
N = int(input())
A = list(range(2*N+1))
A[0] = 1
for i in range(2,2*N+1):
    A[i] = (A[i-1]*i)%MOD
B = list(range(2*N+1))
B[2*N] = pow(A[2*N],MOD-2,MOD)
for i in range(2*N-1,-1,-1):
    B[i] = (B[i+1]*(i+1))%MOD
def f(n,k):
    if k>n or k<0:
        return 0
    if k==0 or k==n:
        return 1
    return (A[n]*B[k]*B[n-k])%MOD
ans = 1
for i in range(1,N+1):
    ans = (ans*f(2*i,2))%MOD
print(ans)