output_description: Print the answer modulo 10^9 + 7.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: def bigmod(v, n10, m):
      """
      >>> bigmod(1, 2, 9)
      1
      >>> bigmod(2343413, 10, 100005)
      1
      """
      # print((v*10.**n10) % m)
      v %= m
      while n10>0:
          v *= 10
          n10 -= 1
          v %= m
      return v
  
  def main():
      n = int(input())
      m = int(10**9+7)
      a = bigmod(n*(n-1), n-2, m)
  
      print(a)
  
  main()
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"}]