#!/usr/bin/env python3

from collections import deque
from heapq import heappop, heappush


dpos4 = ((1, 0), (0, 1), (-1, 0), (0, -1))
def main():
  N = int(input())
  S = "9" * N
  mod = 10 ** 9 + 7
  # i桁目まで確定していて、最後の数字がjのAscNumberの数
  dp = [[0] * 10 for _ in range(N + 1)]
  dp[0][0] = 1
  for i in range(N):
    for j in range(10):
      for d in range(j, 10):
        dp[i + 1][d] += dp[i][j]
        dp[i + 1][d] %= mod

  print(sum(dp[-1]) % mod)

if __name__ == '__main__':
  main()