51nod 1013

求：3^0 + 3^1 +...+ 3^(N) mod 1000000007

Input

输入一个数N(0 <= N <= 10^9)

Output

输出：计算结果

Sample Input

3

Sample Output

40

// 视为等比数列 和为 （1 - q^n)/(1-q) 在本题中 (3^n - 1)/2mod 1000000007
//A/B%mod => A*c%mod c为b的逆元 
#include<cstdio>

typedef long long ll;

const int mod = 1000000007;

ll quickpow(ll a, ll b)
{
	if (b < 0) return 0;
	ll ret = 1;
	a %= mod;
	while(b)
	{
		if (b & 1) ret = (ret * a) % mod;
		b >>= 1;
		a = (a * a) % mod;
	}
	return ret;
} 

ll inv(ll a)
{
	return quickpow(a, mod - 2);
}
//求2的逆元 
ll pow_mod(ll a, ll n, ll mod)
{
	ll res = 1;
	while (n)
	{
		if (n & 1) res = res * a % mod;
		a = a * a % mod;
		n >>= 1;
	}
	return res;
}

int main()
{
	int n;
	scanf ("%d", &n);
	ll sun = pow_mod(3, n+1, mod) - 1; 
	printf ("%lld\n", sun * inv (2) % mod);
	return 0;
}