#include <bits/stdc++.h>
     
    using namespace std;
     
    const int MaxN = 1e5 + 10;
    const int MOD = (int)1e9 + 7;
     
    int dp[MaxN], pw2[MaxN];
     
    int main() {
    //	freopen("input.txt", "r", stdin);
    	pw2[0] = 1;
    	for (int i = 1; i < MaxN; ++i) {
    		pw2[i] = pw2[i - 1] * 2 % MOD;
    	}
    	dp[1] = 1;
    	for (int i = 2; i < MaxN; ++i) {
    		dp[i] = 1LL * dp[i - 1] * (pw2[i - 1] + MOD - 1) % MOD;
    	}
    	int t, en = 0;
    	scanf("%d", &t);
    	assert (1 <= t && t <= 100000);
    	while (t --> 0) {
    		int n;
    		scanf("%d", &n);
    		assert (1 <= n && n <= 100000);
    		en += n;
    		printf("%d\n", dp[n]);
    	}
    	return 0;
    }