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 Kotlin (1.3.71) (judge verdict: Wrong Answer)

import kotlin.math.*
import java.util.*
import java.io.*
val pn:Long = 1000000007L
var x:Long = 1L
var y:Long = 1L
var z:Long = 1L
var ans:Long =0L
fun main() {
    val N = readLine()!!.toLong()
    for(i in 1..N){
        x = (x * 10L)%pn
        y = (y * 9L)%pn
        z = (z * 8L)%pn
    }
    ans = x - (2*y) + z
    if(ans < 0){
        ans = ans + pn
    }
    ans = ans%pn
    println(ans)
}