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 JavaScript (Node.js 12.16.1) (judge verdict: Wrong Answer)

'use script';

{
function Main(input) {
 	const N = input;
	const b = BigInt(1000000000+7);

	function x(m){

		let d = BigInt(1);

		for(i=0; i<N; i++){
				d *= BigInt(m);
				d %= b;
		}
		
	return(d)
	}

	let ans = (x(10)-x(9))+(x(10)-x(9))-(x(10)-x(8))%b;
  	console.log(ans.toString());
  
	}

Main(require("fs").readFileSync("/dev/stdin", "utf8"));

}