#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <bits/stdc++.h>#include <stack>#include <map> using namespace std; #define For(i,j,n) for(int i=j;i<=n;i++)#define mst(ss,b) memset(ss,b,sizeof(ss)); typedef  long long LL; template<class T> void read(T&num) {    char CH; bool F=false;    for(CH=getchar();CH<‘0‘||CH>‘9‘;F= CH==‘-‘,CH=getchar());    for(num=0;CH>=‘0‘&&CH<=‘9‘;num=num*10+CH-‘0‘,CH=getchar());    F && (num=-num);}int stk[70], tp;template<class T> inline void print(T p) {    if(!p) { puts("0"); return; }    while(p) stk[++ tp] = p%10, p/=10;    while(tp) putchar(stk[tp--] + ‘0‘);    putchar(‘\n‘);} const LL mod=1e9+7;const double PI=acos(-1.0);const int inf=1e9;const int N=5e5+20;const int maxn=1e4+220;const double eps=1e-12;struct matrix{    LL a[2][2];};matrix cal(matrix A,matrix B){    matrix C;    for(int i=0;i<2;i++)    {        for(int j=0;j<2;j++)        {            C.a[i][j]=0;            for(int k=0;k<2;k++)            {                C.a[i][j]=(C.a[i][j]+A.a[i][k]*B.a[k][j])%mod;            }        }    }    return C;}matrix pow_mod(LL x){    matrix s,base;    base.a[0][0]=base.a[1][1]=base.a[1][0]=1;base.a[0][1]=2;    s.a[0][0]=s.a[1][1]=1;s.a[0][1]=s.a[1][0]=0;    while(x)    {        if(x&1)s=cal(s,base);        base=cal(base,base);        x>>=1;    }    return s;}int main(){    LL n,ans=0;    read(n);    if(n<0)cout<<"no\n";    else if(n==0)cout<<"1\n";    else {    matrix temp=pow_mod(n-1);    if(n%2==0)    {        ans=(temp.a[0][0]+temp.a[0][1])%mod;        ans=ans*ans%mod;    }    else     {        //cout<<temp.a[1][0]<<t        ans=(temp.a[1][0]+temp.a[1][1])%mod;        ans=ans*ans%mod*2%mod;    }    cout<<ans<<endl;}    return 0;}