#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
using namespace std;
#define rep(i, a, b) for(ll i = (a); i <= (b); i++)
#define lep(i, a, b) for(ll i = (a); i >= (b); i--)
// #define int ll
using namespace std;

const ll p = 998244353;
const int N = 1e6 + 10;
vector<int> e[N];

ll n, m, k;
ll a[N], bs[N], cnt[N];

ll qmi(ll a, ll b)
{
    if(b < 0) return 1;
    ll res = 1;
    for(; b; b >>= 1, a = a * a % p) if(b & 1) res = res * a % p; return res;
}

ll insert(ll x)
{
    lep(i, 20, 0) if(x >> i & 1)
    {
        if(bs[i] == 0)
        {
            bs[i] = x; return 1;
        }
        x ^= bs[i];
    }

    return 0;
}

void solve()
{
    cin >> n; 
    rep(i, 0, 20) bs[i] = 0; rep(i, 1, n) cnt[i] = 0;
    ll c1 = 0;
    rep(i, 1, n) cin >> a[i], c1 += insert(a[i]), cnt[a[i]]++;
    
    ll res = qmi(2ll, n - c1) - 1; res = (res % p + p) % p;

    //cout << res << '\n';
    rep(i, 1, n)
    {
        ll c2 = 0, c3 = 0; rep(i, 0, 20) bs[i] = 0;
        for(auto j : e[a[i]]) if(j < a[i]) c2 += cnt[j], c3 += insert(j);
        //cout << a[i] << ' ' << qmi(2, c2 - c3) << ' ' << c2 << ' ' << c3 << '\n';
        (res += qmi(2, c2 - c3)) %= p;
    }

    cout << (res % p + p) % p << '\n';
}
// 101 011 001

signed main()
{
    IOS;
    int T = 1;
    for(ll i = 1; i <= N - 1; i++) for(ll j = i; j <= N - 1; j += i) e[j].push_back(i); 

    cin>>T;
    while(T--) solve();
    return 0;
}