Problem Description

soda has a set S with n integers {1,2,…,n}. A set is called key set if the sum of integers in the set is an even number. He wants to know how many nonempty subsets of S are key set.

 

Input

There are multiple test cases. The first line of input contains an integer T (1≤T≤105), indicating the number of test cases. For each test case:

The first line contains an integer n (1≤n≤109), the number of integers in the set.

 

Output

For each test case, output the number of key sets modulo 1000000007.

 

Sample Input

 

Sample Output

 

#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

using namespace std;

#define N 500

long long Pow(long long a, long long b, long long c)

{

    long long ans = ;

    a %= c;

    while(b)

    {

        if(b %  == )

            ans = (ans * a) % c;

        a = (a * a) % c;

        b /= ;

    }

    return ans;

}//快数幂，求a的b次幂，c表示对c取余

int main()

{

    int t;

    long long n, num;

    scanf("%d", &t);

    while(t--)

    {

        scanf("%lld", &n);

        num = Pow(, n - , );

        printf("%lld\n", num - );

    }

    return ;

}