MOD = 10**9 + 7

N = int(input())

# Compute the denominator: 9!
denominator = 1
for i in range(1, 10):
    denominator = denominator * i % MOD

# Compute the inverse of the denominator using Fermat's little theorem
inv_denominator = pow(denominator, MOD - 2, MOD)

# Compute the numerator: (N+1) * (N+2) * ... * (N+9)
numerator = 1
for i in range(1, 10):
    numerator = numerator * (N + i) % MOD

# The result is (numerator * inv_denominator) % MOD
result = numerator * inv_denominator % MOD

print(result)