output_description: Print the answer modulo 10^9 + 7.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: p = 1000000007
  
  
  def ncr(n, r, p):
      num = den = 1
      for i in range(r):
          num = (num * (n - i)) % p
          den = (den * (i + 1)) % p
      return (num * pow(den, p - 2, p)) % p
  
  
  def factor(k, p):
      fact = 1
      for i in range(1, k + 1):
          fact = fact * i
      # print (fact)
      return (fact) % p
  
  
  n = int(input())
  sum = 0
  for i in range(2, n + 1):
      m = ncr(n, i, p)
      # print(m)
      f = factor(i, p)
      # print(f)
      sum = sum + (m * f)
      # print (sum)
  print(sum)
  
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"}]