#include <bits/stdc++.h>
using namespace std;
using i128 = __int128_t;
#define int long long
#define endl '\n'
#define ar array<int,2>
#define fi first
#define se second
random_device rd;
mt19937 mt(rd());
const int md = 998244353;
const int N = 5e5+10;
const int inf= 1e18;
const double eps=1e-10;
int p[N],cnt,a[N];
int ksm(int base, int power, int p) {
	int result = 1;
	while (power > 0) {
		if (power & 1)result = result * base % p;
		base = base * base % p ;
		power >>= 1;
	}
	return result % p;
}
void insert(int x) {
	for(int i=60; i>=0; i--) {
		if((x>>i)&1) {
			if(!p[i]) {
				p[i]=x;
				cnt++;
				return ;
			} else
				x^=p[i];
		}
	}
}
void solve() {
	int ans=0;
	cnt=0;
	int n;
	cin >> n;
	for(int i=60; i>=0; i--)
		p[i]=0;
	for(int i=1; i<=n; i++)
		a[i]=0;
	for(int i=1; i<=n; i++) {
		int k;
		cin >> k;
		insert(k);
		a[k]++;
	}
	for(int i=1; i<=n; i++) {
		int o=1;
		if(a[i]) {
			for(int j=1; j*j<=i; j++) {
				if(j!=i&&i%j==0) {
					o=(o*ksm(2,a[j]-1,md))%md;
					if(j*j!=i&&i/j!=i)
						o=(o*ksm(2,a[i/j]-1,md))%md;
				}
			}
			ans=(ans+ksm(2,a[i]-1,md)*o%md)%md;
		}
	}
	ans=(ans+ksm(2,n-cnt,md))%md;
	cout << ans-1 << endl;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
}