Unique Code Generator

You are given an integer n representing the length of a code. Each position in the code can be filled by one of 16 possible characters: the ten digits (0-9) or one of the six symbols from the set {A, B, C, D, E, F}. The goal is to calculate the total number of unique codes of length n, and then output the result modulo \(10^9+7\). In other words, you need to compute

[ 16^n \mod (10^9+7) ]

Input: A single integer n (where 1 ≤ n ≤ 10⁵) is provided via standard input (stdin).

Output: A single integer representing the value of \(16^n \mod (10^9+7)\) printed on standard output (stdout).

inputFormat

A single integer n (1 ≤ n ≤ 10^5) provided via the standard input.

outputFormat

A single integer representing the total number of unique codes modulo 10^9+7.## sample

1

16