#include<iostream>
using namespace std;
long long int quickmod(long long int a,long long int b,long long int c)
{
long long int num=1;
a=a%c;
while(b>0)
{
if(b%2==1)
{
num=(num*a)%c;
}
b/=2;
a=(a*a)%c;
}
return num;
}
int main()
{
long long int T,n,i;
cin>>T;
while(T--)
{
cin>>n;
if(n==1)
{
cout<<'0'<<endl;
}
else
{
cout<<quickmod(2,n-1,1000000007)-1<<endl;
}
}
return 0;
}
using namespace std;
long long int quickmod(long long int a,long long int b,long long int c)
{
long long int num=1;
a=a%c;
while(b>0)
{
if(b%2==1)
{
num=(num*a)%c;
}
b/=2;
a=(a*a)%c;
}
return num;
}
int main()
{
long long int T,n,i;
cin>>T;
while(T--)
{
cin>>n;
if(n==1)
{
cout<<'0'<<endl;
}
else
{
cout<<quickmod(2,n-1,1000000007)-1<<endl;
}
}
return 0;
}