#include <iostream>
#include <vector>
using namespace std;

const long long mod=1000000007;
const vector<vector<long long>>a{
  {1,0,0,0,1,1},
  {0,1,0,1,0,1},
  {0,0,1,1,1,0},
  {3,0,0,0,0,0},
  {0,3,0,0,0,0},
  {0,0,3,0,0,0}
};
const vector<vector<long long>> b={
    {1},{0},{0},{3},{0},{0}
};

vector<vector<long long>> matrix_mul(const vector<vector<long long>>& A,const vector<vector<long long>>&B){
  vector<vector<long long>>C(A.size(),vector<long long>(B.at(0).size(),0));
  for(int i=0;i<A.size();i++){
    for(int k=0;k<B.size();k++){
      for(int j=0;j<B.at(0).size();j++){
        C.at(i).at(j)=(C.at(i).at(j)+A.at(i).at(k)*B.at(k).at(j))%mod;
      }
    }
  }
  return C;
}

vector<vector<long long>> matrix_exp(vector<vector<long long>> X,long long n){
  vector<vector<long long>>Y(X.size(),vector<long long>(X.size(),0));
  for(int i=0;i<X.size();i++){
    Y.at(i).at(i)=1;
  }
  while(n>0){
    if(n&1){
      Y=matrix_mul(Y,X);
    }
    X=matrix_mul(X,X);
    n>>=1;
  }
  return Y;
}

long long calculate_nth(long long n,vector<vector<long long>> A){
  A=matrix_exp(A,n);
  vector<vector<long long>> res;
  res=matrix_mul(A,b);
  return res.at(3).at(0);
}

long long mod_pow(long long x,long long n,long long m){
  long long res=1;
  while(n>0){
    if(n&1){
      res=res*x%m;
    }
    x=x*x%m;
    n>>=1;
  }
  return res;
}

void solve(){
  long long N;
  cin>>N;
  long long ans,c,An;
  ans=calculate_nth(N,a);
  c=mod_pow(mod_pow(3,mod-2,mod),N+1,mod);
  An=ans*c%mod;
  cout<<An<<endl;
  return;
}

int main(){
  int T;
  cin>>T;
  for(int i=0;i<T;i++){
    solve();
  }
  return 0;
}