#include <bits/stdc++.h>
using namespace std;

const int MAXN(2e5 + 5);
const int MOD(998244353);

int n, ans;
vector<pair<int, int>> vec[MAXN];
int book[MAXN];
int c[20];


int quickPow(int x, int p) {
	int res = 1;
	for (; p; x = 1ll * x * x % MOD, p >>= 1) {
		if (p & 1) res = 1ll * res * x % MOD;
	}
	return res;
} 

int insert(int x) {
	for (int i = 19; i >= 0; i--) {
		if ((x >> i) & 1) {
			if (c[i]) x ^= c[i];
			else {
				c[i] = x;
				return -1;
			}
		}
	}
	return 0;
}

int calc(int x) {
	int cnt = 0;
	memset(c, 0, sizeof c);
	for (auto p : vec[x]) {
		cnt += p.second + insert(p.first);
	}
	return quickPow(2, cnt);
}

void solve() {
	scanf("%d", &n);
	for (int i = 0; i <= n; i++) {
		vec[i].clear();
		book[i] = 0;
	}
	for (int i = 1; i <= n; i++) {
		int x; scanf("%d", &x);
		book[x]++;
	}
	for (int i = 1; i <= n; i++) {
		if (book[i]) {
			vec[0].emplace_back(i, book[i]);
			for (int j = i * 2; j <= n; j += i) {
				vec[j].emplace_back(i, book[i]);
			}
		}
	}
	ans = (calc(0) + MOD - 1) % MOD;
	for (int i = 1; i <= n; i++) {
		if (book[i]) {
			ans = (ans + 1ll * book[i] * calc(i)) % MOD;
		}
	}
	printf("%d\n", ans);
}

int main() {
	int _;
	scanf("%d", &_);
	while (_--) {
		solve();
	}
	return 0;
}