#include<bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair<int,int>
#define lson 2*p
#define rson 2*p+1
//#define endl "\n"
#define x first
#define y second
#define lowbit(x) x&-x
const int N=2e5+10;
const int mod=998244353;
int d[25],a[N],p[N];
void insert(int x) {
	for(int i=20;i>=0;i--) {
		if(!(x>>i&1)) continue;
		if(d[i]) x^=d[i];
		else {
			d[i]=x;
			return ;
		}
	}
}
void solve() {
    int n;
	cin>>n;
	memset(d,0,sizeof d);
	vector<int> cnt(n+10,0),res(n+10,1);
	for(int i=1;i<=n;i++) {
		cin>>a[i];
		insert(a[i]);
		cnt[a[i]]++;
	}
	int r=0;
	int ans=0;
	for(int i=20;i>=0;i--) if(d[i]) r++;
	ans+=p[n-r]-1;
	for(int i=1;i<=n;i++) {
		int num=cnt[i];
		if(num<2) continue;		
		for(int j=i+i;j<=n;j+=i) {
			res[j]=res[j]*p[num-1]%mod;
		}
		num--;
		if(num<2) continue;	
		res[i]=res[i]*p[num-1]%mod;
	}
	for(int i=1;i<=n;i++) {
		if(!cnt[i]) continue;
		ans=(ans+cnt[i]*res[i]%mod)%mod;
	}
	cout<<ans<<endl;
}
signed main() {
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    int T=1;
    cin>>T;
	p[0]=1;
	for(int i=1;i<=2e5;i++) p[i]=p[i-1]*2%mod;
    while(T--) {
        solve();
    }
}