MOD = 10**9 + 7

N = int(input())

max_fact = 2 * N - 1
if N == 0:
    print(0)
    exit()

# Precompute factorial and inverse factorial arrays
fact = [1] * (max_fact + 1)
for i in range(1, max_fact + 1):
    fact[i] = fact[i-1] * i % MOD

inv_fact = [1] * (max_fact + 1)
inv_fact[max_fact] = pow(fact[max_fact], MOD-2, MOD)
for i in range(max_fact - 1, -1, -1):
    inv_fact[i] = inv_fact[i + 1] * (i + 1) % MOD

def comb(n, k):
    if k < 0 or k > n:
        return 0
    return fact[n] * inv_fact[k] % MOD * inv_fact[n - k] % MOD

t_max = N // 2
result = 0

for t in range(t_max + 1):
    m = N + 2 * t
    if m > 2 * N:
        continue
    n = m - 1
    k = t
    current = (comb(n, k) - comb(n, k - 1)) % MOD
    result = (result + current) % MOD

print(result % MOD)