#include<bits/stdc++.h>
using namespace std;
constexpr int M=2e5+5,mod=998244353;
int n,m,ans,cnt,sum,p[20],pw[M],buc[M];
int read(){
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)) {if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x*f;
}
int reduce(int x){return x>=mod?x-mod:x;}
void insert(int x){
	for (int i=m;~i;i--)
		if (x>>i&1){
			if (!p[i]) {p[i]=x;cnt++;break;}
			x^=p[i];
		}
}
bool check(int x){
	for (int i=m;~i;i--)
		if (x>>i&1) x^=p[i];
	return !x;
}
void solve(){ n=read();m=__lg(n);
	for (int i=1;i<=n;i++) buc[read()]++;
	for (int i=pw[0]=1;i<=n;i++) pw[i]=reduce(pw[i-1]*2);
	for (int i=1;i<=n;i++){ cnt=sum=0;
		for (int j=0;j<=m;j++) p[j]=0;
		for (int j=i;j<=n;j++)
			if (buc[j]) sum+=buc[j],insert(j);
		if (check(i)) ans=reduce(ans+pw[sum-cnt]);
	}
	printf("%d\n",ans);
	for (int i=1;i<=n;i++) buc[i]=0;
}
int main(){int T=read();
	while (T--) solve();
	return 0;
}