output_description: Print the answer modulo 10^9 + 7.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: def calculate(n):
      mod = 1000000000 + 7
  
      result = pow(10, n, mod)
  
      # has 0 exists  9 not exists
      # 0 - 8
      s1 = pow(9, n, mod) - pow(8, n, mod)
  
      # has 9 exists 0 not exists
      # 1 - 9
      s2 = pow(9, n, mod) - pow(8, n, mod)
  
      # 9 not exists and 8 not exists
      # 1-8
      s3 = pow(8, n, mod)
  
      result = result - (s1 + s2 + s3)
  
      print(result % mod)
  
  
  calculate(int(input()))
  
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"}]