#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#define itr(x,c) for(auto x=c.begin();x!=c.end();x++)
#define ritr(x,c) for(auto x=c.rbegin();x!=c.rend();x++)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
using namespace std;
using ll=long long;
using pll=pair<ll,ll>;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} return 0;}
template<class T>istream& operator >> (istream& is, vector<T>& v) { for(T& x:v) is >> x; return is; }
template<class T>ostream& operator << (ostream& os, const vector<T>& v) {for(int i=0;i<v.size();i++) {os << v[i] << (i+1 == v.size() ? "":" ");} return os;}
template<class T1, class T2>istream& operator >> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
//istream& operator >> (istream& is, modint1000000007& x) { unsigned int t; is >> t; x=t; return is; }
//istream& operator >> (istream& is, modint998244353& x) { unsigned int t; is >> t; x=t; return is; }
ostream& operator << (ostream& os, const modint1000000007& x) { os << x.val(); return os; }
ostream& operator << (ostream& os, const modint998244353& x) { os << x.val(); return os; }
template<class... A> void pt()      { std::cout << "\n"; }
template<class... A> void pt_rest() { std::cout << "\n"; }
template<class T, class... A> void pt_rest(const T& first, const A&... rest) { std::cout << " " << first; pt_rest(rest...); }
template<class T, class... A> void pt(const T& first, const A&... rest)      { std::cout << first; pt_rest(rest...); }

static const ll INF=1e18+7;
static const ll MAX=101010;
static const ll MOD=1e9+7;
static const double PI=acos(-1);
static const double EPS=1e-10;
//static const ll MOD=998244353;

using v1d=vector<modint1000000007>;
using v2d=vector<v1d>;
using v3d=vector<v2d>;
using v4d=vector<v3d>;

typedef v2d MAT;

MAT mul(MAT &A,MAT &B){
  ll n=A.size();
  ll m=B[0].size();
  ll l=B.size();
  
  MAT C(n,v1d(m));
  ll i,j,k;
  for(i=0;i<n;i++)for(j=0;j<m;j++)for(k=0;k<l;k++)C[i][j]+=A[i][k]*B[k][j];
  return C;
}

MAT powmat(MAT X,ll n){
  ll R=X.size();
  MAT res(R,v1d(R));
  for(ll i=0;i<R;i++)res[i][i]=1;
  while(n) {
    if(n&1) res=mul(res,X);
    X=mul(X,X);
    n>>=1;
  }
  return res;
}

int main(void){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  ll i,j,k;
  
  ll T;cin>>T;
  while(T--){
    ll N;cin>>N;
    MAT A(6,v1d(6,0));
    modint1000000007 three=3;
    
    for(i=0;i<3;i++)A[i][i]=three.inv();
    for(i=0;i<3;i++)for(j=3;j<6;j++)if(j-3!=i)A[i][j]=three.inv();
    for(i=3;i<6;i++)for(j=0;j<3;j++)if(j==i-3)A[i][j]=1;
    
    A=powmat(A,N);
    MAT b(6,v1d(1,0));
    b[0][0]=three.inv();
    b[3][0]=1;
    pt(mul(A,b)[3][0]);
    
  }
  
}