#include<bits/stdc++.h>
using namespace std;
long long mod=1e9+7;
long long m=2,ff[20000055];
long long f,p=500000004,pp=500000004;
int main()
{
f=ff[1]=p;
for (int i=2; i<=20000050; i++)
{
m=m*2%mod; pp=pp*p%mod;
f=f%mod*(m-1)%mod*pp%mod;
ff[i]=ff[i-1]^f;
}
int t,n;
cin>>t;
while (t--)
{
cin>>n;
cout<<ff[n]<<endl;
}
}