Problem:
Score : 300 points

Problem 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.

Constraints

1 \leq N \leq 10^6

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the answer modulo 10^9 + 7.

Sample Input 1

2

Sample Output 1

2

Two sequences \{0,9\} and \{9,0\} satisfy all conditions.

Sample Input 2

1

Sample Output 2

0

Sample Input 3

869121

Sample Output 3

2511445

Solution in PyPy3 (7.3.0) (judge verdict: Accepted)

'''
Created on 2020/09/14

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  N=int(pin())
  mod=10**9+7
  if N==1:
    print(0)
  elif N==2:
    print(2)
  else:
    ans1=1 #全体
    ans0=1  #0がないor9がない
    ans2=1 #0と9がない
    for i in range(N):
      ans1=(ans1*10)%mod 
      ans0=(ans0*9)%mod 
      ans2=(ans2*8)%mod 
    ans=(ans1-2*ans0+ans2)%mod
    print(ans)
  return
main()