#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
#define MOD 1000000007
long long ksm(long long x,long long n)
{
    long long pw = 1;
    while (n > 0)
    {
        if (n & 1)        // n & 1 等价于 (n % 2) == 1
            pw =(pw*x+MOD)%MOD;
        x =(x*x+MOD)%MOD;
        n >>= 1;        // n >>= 1 等价于 n /= 2
    }

    return pw;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        long long n;
        scanf("%lld",&n);
        n=n-1;
        printf("%lld\n",ksm(2,n)-1);
    }
    return 0;
}