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

const int MOD = 998244353;

template<int bit>
struct LinearBasis
{
    vector<ll> v;
    LinearBasis() { v.resize(bit); }
    void insert(ll x)
    {
        for (int i = bit - 1; i >= 0; --i)
        {
            if (x >> i & 1ll)
            {
                if (v[i]) x ^= v[i];
                else
                {
                    v[i] = x;
                    break;
                }
            }
        }
        return;
    }
    int rank()
    {
        int cnt = 0;
        for (auto e : v)
        {
            if (e) cnt++;
        }
        return cnt;
    }
};

ll qpow(ll a, ll p)
{
    ll res = 1;
    while (p)
    {
        if (p & 1) res = res * a % MOD;
        a = a * a % MOD;
        p >>= 1;
    }
    return res;
}

int n, a[200005];

void solve()
{
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    // xorsum = max_element
    vector<ll> cnt(n + 1);
    for (int i = 1; i <= n; ++i) cnt[a[i]]++;
    vector<vector<int>> f(n + 1);
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; i * j <= n; ++j)
        {
            f[i * j].push_back(i);
        }
    }
    ll ans = 0;
    for (int i = 1; i <= n; ++i)
    {
        if (!cnt[i]) continue;
        ll res = 1, tot = 0;
        LinearBasis<32> lb;
        for (auto e : f[i])
        {
            tot += cnt[e];
            lb.insert(e);
        }
        ans += qpow(2, tot - lb.rank());
        ans %= MOD;
    }
    LinearBasis<32> lb;
    for (int i = 1; i <= n; ++i) lb.insert(a[i]);
    ans += qpow(2, n - lb.rank());
    ans %= MOD;
    cout << (ans + MOD - 1) % MOD << '\n';
    return;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}