#include<iostream>
#include<algorithm>
#include<cstring>
#define lowbit(x) (x & (-x))
using namespace std;
const int N = 2e5 + 10, MOD = 998244353;
int k[25], n, t[N], cnt;
long long qpow(long long x, long long k){
	long long ret = 1;
	while(k){
		if(k & 1)
			ret = ret * x % MOD;
		x = x * x % MOD, k >>= 1;
	}
	return ret;
}
void ins(int x){
	for(int i = 20; ~i; i--){
		if((x >> i) & 1){
			if(k[i])
				x ^= k[i];
			else{
				k[i] = x, cnt++;
				break;
			}
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	int Cases;
	cin >> Cases;
	while(Cases--){
		cin >> n;
		memset(k, 0, sizeof(k));
		memset(t, 0, sizeof(int) * (n + 1));
		cnt = 0;
		for(int i = 1, x; i <= n; i++){
			cin >> x;
			t[x]++;
			ins(x);
		}
		long long ans = qpow(2, n - cnt) - 1;
		for(int i = 1; i <= n; i++){
			if(t[i]){
				int sum = 0;
				cnt = 0;
				memset(k, 0, sizeof(k));
				for(int j = 1; j * j <= i && j < i; j++){
					if(i % j == 0){
						if(t[j]){
							sum += t[j];
							ins(j);
						}
						if(i / j != j && i / j != i && t[i / j]){
							sum += t[i / j];
							ins(i / j);
						}
					}
				}
				long long as = t[i], C = t[i];
				for(int i = 3; i <= t[i]; i += 2)
					C = C * (t[i] - i + 2) % MOD * (t[i] - i + 1) % MOD, as = (as + C) % MOD;
				ans = (ans + as * qpow(2, sum - cnt)) % MOD;
			}
		}
		cout << ans << endl;
	}
}