1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<cmath>
 5 #include<algorithm>
 6 #include<queue>
 7 #include<cstdlib>
 8 #include<iomanip>
 9 #include<cassert>
10 #include<climits>
11 #define maxn 1200
12 #define F(i,j,k) for(int i=j;i<=k;i++)
13 #define M(a,b) memset(a,b,sizeof(a))
14 #define FF(i,j,k) for(int i=j;i>=k;i--)
15 #define inf 0x7fffffff
16 const int q=1000000007;
17 using namespace std;
18 int read(){
19     int x=0,f=1;char ch=getchar();
20     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
21     while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;ch=getchar();}
22     return x*f;
23 }
24 int T,n;
25 int a[1010];
26 int dp[1010][1025],dp1[1010][1025],s[1010][1025];
27 int main()
28 {
29     std::ios::sync_with_stdio(false);//cout<<setiosflags(ios::fixed)<<setprecision(1)<<y;
30 //  freopen("data.in","r",stdin);
31 //  freopen("data.out","w",stdout);
32     cin>>T;
33     while(T--)
34     {
35         cin>>n;
36         for(int i=1;i<=n;i++)
37             cin>>a[i];
38         memset(dp,0,sizeof(dp));
39         dp[0][0]=1;
40         for(int i=1;i<=n;i++)
41         {
42             for(int j=0;j<1024;j++)
43             {
44                 dp[i][j]=dp[i-1][j]+dp[i-1][j^a[i]];
45                 if(dp[i][j]>=q)  dp[i][j]-=q;
46             }
47             for(int j=0;j<1024;j++)
48                 s[i][j]=dp[i-1][j^a[i]];
49         }
50         memset(dp1,0,sizeof(dp1));
51         for(int i=n;i>=1;i--)
52         {
53             dp1[i][a[i]]++;
54             for(int j=0;j<1024;j++)
55             {
56                 dp1[i][j&a[i]]=(dp1[i][j&a[i]]+dp1[i+1][j])%q;
57                 dp1[i][j]=(dp1[i][j]+dp1[i+1][j])%q;
58             }
59         }
60         int ans=0;
61         for(int k=1;k<=n-1;k++)
62         {
63             for(int j=0;j<1024;j++)
64             {
65                 ans=(ans+(long long)s[k][j]*dp1[k+1][j])%q;
66                 if(ans>=q) ans-=q;
67             }
68         }
69         cout<<ans<<endl;
70     }
71     return 0;
72 }