#include <bits/stdc++.h>


using namespace std;


using ll = long long;

#define rep(i, n) for(int i = 0; i < (n); i += 1)
#define rng(i, start, end, step) for(int i = start; i < end; i += step)
#define len(a) ((int)(a).size())


mt19937 rnd(234);


const ll mod = 998244353;



ll bin_pow(ll x, ll n) {
    ll rs = 1;
    for (ll i = 1, a = x; i <= n; i *= 2, a = a * a % mod)
        if (n & i) rs = rs * a % mod;
    return rs;
}


int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    int t;
    cin >> t;
    rep(itr, t) {
        int n;
        cin >> n;
        vector<int> cnt(n + 1, 0);
        vector<int> a(n);
        rep(i, n) {
            int x;
            cin >> x;
            a[i] = x;
            cnt[x] += 1;
        }
        vector<ll> good(n + 1, 0);
        vector<vector<int>> mat(n + 1);
        for (ll x = 1; x <= n; x += 1) {
            if (cnt[x] > 0) {
                for (ll y = 2 * x; y <= n; y += x) {
                    mat[y].push_back(x);
                    good[y] += cnt[x] - 1;
                }
            }
        }
        auto get = [&](vector<int> arr) {
            while (!arr.empty()) {
                int mxi = 0;
                rep(i, len(arr)) if (arr[mxi] < arr[i]) mxi = i;
                if (arr[mxi] == 0) {
                    break;
                }
                swap(arr[mxi], arr.back());
                int mx = arr.back();
                arr.pop_back();
                int j = __lg(mx);
                for (auto& x : arr) {
                    if ((x >> j) & 1) x ^= mx;
                }
            }
            return len(arr);
            };
        ll result = 0;
        for (ll y = 1; y <= n; y += 1) {
            if (cnt[y] == 0) continue;
            good[y] += get(mat[y]);
            ll val = bin_pow(2, cnt[y] - 1 + good[y]);
            result = (result + val) % mod;
        }
        result = (result + bin_pow(2, get(a)) + mod - 1) % mod;
        cout << result << "\n";
    }
    return 0;
}