# Arup Guha
# 8/18/2026
# Alternate (slower) Solution to 2026 UCF Locals Problem: Battle of Wills
# Note: This uses the O(n^2) recurrence (number of unique binary search
#       trees of n items) to find the nth Catalan number.

# Process cases, have to mod again!
def main():
    MOD = 1000000007
    n = int(input())
    print( (2*catalan(n-1))%MOD)

# Returns the nth Catalan number under mod.
def catalan(n):

    # Our mod.
    MOD = 1000000007

    # Catalan of 0.
    dp = [1]

    # Generate the rest of the Catalan numbers in order.
    for i in range(1,n+1):

        # Here we are doing C(i) = C(0)*C(i-1)+C(1)*C(i-2)+...+C(i-1)*C(0)
        tmp = 0
        for j in range(i):
            tmp = (tmp + dp[j]*dp[i-1-j])%MOD

        # Add for next iteration.
        dp.append(tmp)

    # Here is our answer.
    return dp[n]

# Run it!
main()