INF = 10 ** 9
MOD = 10 **9 + 7
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)

def nck_nbig(n,r,mod = MOD):
    r = min(n,r)
    if r == 0:
        return 1
    num,inv_num = 1,1
    for i in range(1,r + 1):
        num = num * (n - i + 1) %mod
        inv_num = inv_num * i % mod
    return num * pow(inv_num,mod - 2,mod)%mod

def main():
    n = int(input())
    ans = 10
    for i in range(2,n + 1):
        ans += nck_nbig(i + 8,8)
        ans %= MOD
    print(ans)
if __name__=='__main__':
    main()