1 import java.math.BigInteger;
 2 import java.util.Scanner;
 3 
 4 public class Main{
 5 
 6     /**
 7      * @param args
 8      */
 9     public static void main(String[] args) {
10         Scanner in=new Scanner(System.in);
11         int mod=1000000007;
12         while(in.hasNextInt())
13         {
14             int T=in.nextInt();
15             for(int a=1;a<=T;a++)
16             {
17                 int n=in.nextInt();
18                 long[] p=new long[10010];
19                 long[] r=new long[10010];
20                 p[1]=1;
21                 for(int i=2;i<=n;i++)
22                 {
23                     p[i]=p[i-1]*2;
24                     p[i]=p[i]%mod;
25                 }
26                 r[1]=1;
27                 r[2]=6;
28                 for(int i=3;i<=n;i++)
29                 {
30                     r[i]=2*r[i-1]+p[i]+4*r[i-2];
31                     r[i]=r[i]%mod;
32                 }
33                 long ans=4*r[n];
34                 for(int i=2;i<=n;i++)
35                 {
36                     ans=ans+((8*p[n-i]*r[i-1])%mod+(8*r[n-i]*p[i-1])%mod)%mod;
37                     ans=ans%mod;
38                 }
39                 System.out.println(n==1?2:ans);
40             }
41         }
42     }
43 
44 }