Codeforces Round #118 (Div. 2)-C-Plant（构造矩阵）

A. Plant

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 %I64dspecifier.

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.

1 题目要求找到在n年后向上三角形的个数

2 写出前面的几个数F(0) = 1 , F(1) = 3 , F(2) = 10 , F(3) = 36 , F(4) = 136

   通过前面几项我们可以找到通项公式F[n] = 4*F[n-1]-2^(n-1)

     那么我们通过够找矩阵

   | 4 -1 |  *  | F(n-1) | = | F(n) |

   | 0 2 |      | 2^(n-1) |   | 2^n |

#include<map>    
#include<stack>    
#include<queue>  
#include<vector>    
#include<math.h>    
#include<stdio.h>  
#include<iostream>
#include<string.h>    
#include<stdlib.h>    
#include<algorithm>    
using namespace std;    
typedef __int64 ll;    
#define inf 1000000000    
#define mod 1000000007   
#define maxn  35005
#define lowbit(x) (x&-x)    
#define eps 1e-10  
struct node
{
	ll x[2][2];
}a;
node q1(node a,node b)
{
	node c;
	int i,j,k;
	for(i=0;i<2;i++)
		for(j=0;j<2;j++)
		{
			c.x[i][j]=0;
			for(k=0;k<2;k++)
				c.x[i][j]+=a.x[i][k]*b.x[k][j];
			c.x[i][j]%=mod;
		}
		return c;
}
node q(ll y)
{
	node b;
	b.x[0][0]=b.x[1][1]=1;
	b.x[0][1]=b.x[1][0]=0;
	while(y)
	{
		if(y%2)
			b=q1(b,a);
		a=q1(a,a);
		y/=2;
	}
	return b;
}
int  main(void)
{
	ll n,ans=0;
	a.x[0][0]=4;a.x[0][1]=-1;
	a.x[1][0]=0;a.x[1][1]=2;
	scanf("%lld",&n);
	if(n==0)
	{
		printf("1\n");
		return 0;
	}
	node tmp=q(n);
	ans=(tmp.x[0][0]+tmp.x[0][1]+mod)%mod;
	printf("%lld\n",ans);
	return 0;
}