#include<bits/stdc++.h>

using namespace std;

const int MAXN = 4e5 + 5, Mod = 998244353;

int n, cnt[MAXN];

vector<int> t[MAXN];

int base[32];

inline int Fp(int x, int k) {
    int ans = 1; 
    for(; k; k >>= 1, x = 1ll * x * x % Mod) 
        if(k & 1) ans = 1ll * ans * x % Mod;
    return ans;
}

inline int calc(int x) {
    for(int i = 0; i < 32; i++) base[i] = 0;
    for(auto o : t[x]) for(int i = 31; i >= 0; i--) {
        if(o >> i & 1) {
            if(!base[i]) {
                base[i] = o;
                break;
            } else o ^= base[i];
        }
    }
    int v = x;
    for(int i = 31; i >= 0; i--) 
        if(v >> i & 1) v ^= base[i];
    if(v) return 0;
    int pp = 0;
    for(auto o : t[x]) pp += cnt[o]; 
    for(int i = 31; i >= 0; i--) if(base[i]) pp--;
    return Fp(2, pp);
}

inline void Solve() {

    cin >> n;
    for(int i = 0; i <= 2 * n; i++) cnt[i] = 0, t[i].clear();
    for(int i = 1; i <= n; i++) {
        int x; cin >> x;
        cnt[x]++;
    }

    for(int i = 1; i <= n; i++) if(cnt[i]) {
        for(int j = 0; j <= 2 * n; j += i) t[j].push_back(i);
    }
    int ans = 0;
    for(int i = 0; i <= 2 * n; i++) {
        ans = (ans + calc(i)) % Mod;
    }
    cout << (ans - 1 + Mod) % Mod << '\n';
}

int main() {

    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t;
    cin >> t;
    for(; t--; ) Solve();

    return 0;
}