#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
//using mint=modint998244353;
vector<vector<mint>>pow(vector<vector<mint>>A,ll N){
  vector<vector<mint>>res(9,vector<mint>(9)),p(9,vector<mint>(9));
  REP(i,9)res[i][i]=1;
  while(N){
    if(N%2){
      //res*=A
      REP(i,9)REP(j,9)p[i][j]=0;
      REP(i,9)REP(j,9)REP(k,9)p[i][j]+=res[i][k]*A[k][j];
      REP(i,9)REP(j,9)res[i][j]=p[i][j];
    }
    N/=2;
    //A*=A
    REP(i,9)REP(j,9)p[i][j]=0;
    REP(i,9)REP(j,9)REP(k,9)p[i][j]+=A[i][k]*A[k][j];
    REP(i,9)REP(j,9)A[i][j]=p[i][j];
  }
  return res;
}
signed main(){
  ll t;cin>>t;
  REP(q,t){
    ll N;cin>>N;
    vector<vector<mint>>A(9,vector<mint>(9));
    REP(i,3){
      A[i][i]=inv_mod(3,1000000007);
      A[i][3+2*i]=A[i][i];A[i][4+2*i]=A[i][i];
      A[3+2*i][(i+1)%3]=1;A[4+2*i][(i+2)%3]=1;
    }
    cout<<pow(A,N).at(0).at(0).val()<<endl;
  }
  return 0;
}