就是方便计算a的b次方
#include<iostream>
using namespace std;
int main()
{
//string name;
//name="abcd";
//cout<<name<<endl;
long long a,n;
cin>>n;
while(n--)
{
long long m,b,j;
cin>>a;
b=a-1;
j=1;m=2;
while(b)
{
if(b&1)
j=j*m%1000000007;
m=m*m%1000000007;
b>>=1;
}
cout<<j-1<<endl;
}
return 0;
}
using namespace std;
int main()
{
//string name;
//name="abcd";
//cout<<name<<endl;
long long a,n;
cin>>n;
while(n--)
{
long long m,b,j;
cin>>a;
b=a-1;
j=1;m=2;
while(b)
{
if(b&1)
j=j*m%1000000007;
m=m*m%1000000007;
b>>=1;
}
cout<<j-1<<endl;
}
return 0;
}