{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1515056452',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://www.xiaopingtou.cn//data/attach/topic/topicKPo7gB.jpg', '推荐 yandechun 的文章《快速幂 a的b次方对c取模》','https://www.xiaopingtou.net/article-52510.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}
#include
#include
#include
#include
using namespace std;
#define N 500
long long Pow(long long a, long long b, long long c)
{
long long ans = 1;
a %= c;
while(b)
{
if(b % 2 == 1)
ans = (ans * a) % c;
a = (a * a) % c;
b /= 2;
}
return ans;
}
int main()
{
int t;
long long n, num;
scanf("%d", &t);
while(t--)
{
scanf("%lld", &n);
num = Pow(2, n - 1, 1000000007);
printf("%lld
", num - 1);
}
return 0;
}