#include <bits/stdc++.h>

const int N = 2e5 + 5, mod = 998244353;

std::vector<int> fac[N];

struct linearBasis {
    int a[19], tot;
    void clear() {
        tot = 0;
        memset(a, 0, sizeof(a));
    }
    void insert(int x) {
        for (int i = 19; i >= 0; --i) {
            if ((x >> i) & 1) {
                if (a[i]) {
                    x ^= a[i];
                } else {
                    if (x) {
                        a[i] = x;
                        ++tot;
                    }
                    break;
                }
            }
        }
    }
} B;

void prep() {
    for (int i = 1; i < N; ++i)
        for (int j = i; j < N; j += i)
            fac[j].emplace_back(i);
}

int qpow(int base, int b, int ret = 1) {
    for (; b; b >>= 1, base = 1ll * base * base % mod)
        if (b & 1)
            ret = 1ll * ret * base % mod;
    return ret;
}

int main() {
    //freopen("in", "r", stdin);
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    prep();
    int ttt;
    std::cin >> ttt;
    while (ttt--) {
        int n;
        std::cin >> n;
        std::vector<int> a(n + 1);
        std::map<int,int> mp;
        B.clear();
        for (int i = 1; i <= n; ++i) {
            std::cin >> a[i];
            B.insert(a[i]);
            ++mp[a[i]];
        }
        int ans = (mod - 1 + qpow(2, n - B.tot)) % mod;
        for (auto &[x, y]: mp) {
            int tot = 0;
            B.clear();
            for (auto &d: fac[x]) {
                B.insert(d);
                tot += mp[d];
            }
            (ans += qpow(2, tot - B.tot)) %= mod;
        }
        std::cout << ans << '\n';
    }
    return 0;
}