fjnu2019级第一次欢乐友谊赛

C - 师

Dwarfs have planted a very interesting plant, which is a triangle directed “upwards”. This plant has an amusing feature. After one year a triangle plant directed “upwards” divides into four triangle plants: three of them will point “upwards” and one will point “downwards”. After another year, each triangle plant divides into four triangle plants: three of them will be directed in the same direction as the parent plant, and one of them will be directed in the opposite direction. Then each year the process repeats. The figure below illustrates this process.

Help the dwarfs find out how many triangle plants that point “upwards” will be in n years.

Input

The first line contains a single integer n (0 ≤ n ≤ 1018) — the number of full years when the plant grew.
Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specifier.

Output

Print a single integer — the remainder of dividing the number of plants that will point “upwards” in n years by 1000000007 (109 + 7).

Examples

Input

1

Output

3

Input

2

Output

10

Note

The first test sample corresponds to the second triangle on the figure in the statement. The second test sample corresponds to the third one.

题意

有一个三角形，每次操作把一个三角形分成4个，向上的三角形分成3个向上+1个向下，向下的三角形分成1个向上+3个向下，求经过n次操作有多少个三角形向上。

题解

观察法，观察题目中三角形的变化，发现第n次操作后可以形成2^n行，从上往下数，第i行有i个向上的三角形。
接着使用等差数列求和公式ans=(2ⁿ⁽¹⁺²n))/2%(1e9+7)，整理得到(2^(n-1)+2(2*n-1))%(1e9+7)，由于n的数值比较大，所以要使用矩阵快速幂QuickPow，注意特判一下n=0，这时只有原来的一个三角形。

代码

#include<iostream>
using namespace std;
typedef long long LL;
LL M = 1e9 + 7, n, ans;
LL QuickPow(LL x, LL N)
{
	LL res = x, ans = 1;
	while (N)
	{
		if (N & 1)
		{
			ans = (ans * res) % M;
		}
		res = (res * res) % M;
		N = N >> 1;
	}
	return ans % M;
}
int main()
{
	cin >> n;
	if (n == 0)
		printf("1\n");
	else
	{
		ans = (QuickPow(2, (n - 1)) % M + QuickPow(2, (2 * n - 1)) % M) % M;
		cout << ans << endl;
	}
	return 0;
}