#include<bits/stdc++.h> #define int long long #define endl '\n' using namespace std; const int mod=1e9+7; int n; inline int qpow(int a,int b){ int Ans=1; while(b){ if(b&1)Ans=Ans*a%mod; a=a*a%mod;b>>=1; }return Ans; } signed main(){ int T; cin>>T; while(T--){ cin>>n; cout<<(qpow(2,n)-(1+n)%mod+mod)%mod<<endl; }return 0; }