output_description: Print the answer modulo 10^9 + 7.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: n = int(input())
  a = [1] * 10000001
  b = [1] * 10000001
  c = [0] * (n + 1)
  answer = 0
  for i in range(1000001):
      a[i + 1] = (a[i] * 9) % 1000000007
  for j in range(1000001):
      b[j + 1] = (b[j] * 8) % 1000000007
  if n == 1:
      print(0)
  else:
      for k in range(2, n + 1):
          c[k] = 2 * a[k - 1] - 2 * b[k - 1] + 10 * c[k - 1]
          c[k] = c[k] % 1000000007
      print(c[n])
  
problem_description: Statement
  
  How many integer sequences A_1,A_2,\ldots,A_N of length N satisfy all of the
  following conditions?
  
    * 0 \leq A_i \leq 9
    * There exists some i such that A_i=0 holds.
    * There exists some i such that A_i=9 holds.
  
  The answer can be very large, so output it modulo 10^9 + 7.
samples: [{"input": "2", "output": "2\n    \n\nTwo sequences \\\\{0,9\\\\} and \\\\{9,0\\\\} satisfy all conditions.\n\n* * *"}, {"input": "1", "output": "0\n    \n\n* * *"}, {"input": "869121", "output": "2511445"}]