#include<bits/stdc++.h> using namespace std; const int md = 1e9+7; int T; long long n; long long ans; long long quickpow(long long x,long long y){ long long tmp=1; while(y){ if(y&1) tmp=(tmp%md*x%md)%md; y=y>>1; x=x%md*x%md; } return tmp; } signed main(){ cin>>T; while(T--){ cin>>n; ans=0; ans=(quickpow(2,n)%md-2%md-(n-1)%md+md)%md; cout<<ans<<endl; } return 0; }