G - Kolya and Tanya CodeForces - 584B

G - Kolya and Tanya CodeForces - 584B
Problem Description

Kolya loves putting gnomes at the circle table and giving them coins, and Tanya loves studying triplets of gnomes, sitting in the vertexes of an equilateral triangle.

More formally, there are 3n gnomes sitting in a circle. Each gnome can have from 1 to 3 coins. Let’s number the places in the order they occur in the circle by numbers from 0 to 3n - 1, let the gnome sitting on the i-th place have ai coins. If there is an integer i (0 ≤ i < n) such that ai + ai + n + ai + 2n ≠ 6, then Tanya is satisfied.

Count the number of ways to choose ai so that Tanya is satisfied. As there can be many ways of distributing coins, print the remainder of this number modulo 109 + 7. Two ways, a and b, are considered distinct if there is index i (0 ≤ i < 3n), such that ai ≠ bi (that is, some gnome got different number of coins in these two ways).

Input

A single line contains number n (1 ≤ n ≤ 105) — the number of the gnomes divided by three.

Output

Print a single number — the remainder of the number of variants of distributing coins that satisfy Tanya modulo 109 + 7.

Examples

Input
1
Output
20
Input
2
Output
680
Note

20 ways for n = 1 (gnome with index 0 sits on the top of the triangle, gnome 1 on the right vertex, gnome 2 on the left vertex):

题解

对于一个三角形,组合数为 27种,不满足的情况为7种
对于n个: 27ⁿ - 7ⁿ
快速幂

复杂度

O(logn) == log(1e5)

取值范围

27^1e5 % (1e9+7) < 1e9+7 不爆 int
快速幂乘积 爆 int 用 long long

算法

快速幂

代码

#include<bits\stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
int n;

ll quick_mod(ll base, ll power) {
	ll result = 1;
	while(power) {
		if(power&1) {
			result = (result%mod)*(base%mod)%mod;
		}
		power/=2;
		base = (base%mod)*(base%mod)%mod;
	}
	return result;
	
}

int main() {
	freopen("test.in", "r", stdin);
	while(cin >> n) {
		cout << quick_mod(27, n) - quick_mod(7, n) << endl; 
	}
	return 0;
}