import sys
INF = float('inf')
#10**20,2**63,float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
#from collections import defaultdict
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    N = II()
    Less = [[0] * 10 for _ in range(N + 1)]
    Less[0][0] = 1
    for i in range(N):
        # Less[i+1] += Less[i]の遷移
        # (i-1桁までの数)+(0~9)
        for n in range(10):
            for s in range(0,n+1):
                Less[i + 1][n] += Less[i][s]
                Less[i+1][n] %= MOD
        #print("Less:",Less[i+1])
    print(sum(Less[N]) % MOD)
    return
solve()
#sys.setrecursionlimit(10 ** 6)#再帰関数ではコメントにしないこと！！