#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define sp ' '
#define assert(x,a) if(x){cout << a << endl;return;}
#define sortv(x)sort(x.begin(),x.end())
#define revev(x)reverse(x.begin(),x.end())
ll ans1 = 0;
inline void fast(){
std::ios_base::sync_with_stdio(0);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
}
vector<vector<int>>graph;
vector<bool>vis(100001,false);
bool sortbysec(const pair<int,int> &a,
const pair<int,int> &b)
{
return (a.second < b.second);
}
inline void answer(int c){assert(c==0,"NO")cout << "YES" << endl;}
ll pow(ll val)
{
ll temp_ans = 1;
for(int i = 0;i < val;i++)
{
temp_ans = (temp_ans * 2) % 1000000007;
}
return temp_ans % 1000000007;
}
void solve()
{
int n;cin >> n;
ans1 = 1;
if(n % 2 == 0)
{
ans1++;
n--;
}
ll temp = n/2;
while(temp > 0)
{
n-=2;
ans1+=pow(n) % 1000000007;
temp--;
}
cout << ans1 << endl;
}
int main()
{
fast();
ll t{ 1 };cin >> t;
// cin.ignore();
while (t--)
{
solve();
}
}
Copy