#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef double db;
#define int long long
const int N = 2e5 + 10;
const double eps = 1e-10;
#define ull unsigned long long
#define endl '\n'
using i64 = int64_t;
const int mod =998244353;
int ans = 0;int ksm(int a, int b) {
    int ans = 1;
    while (b) {
        if (b % 2 == 1) {
            ans = ans * a % mod;
        }
        b /= 2;
        a = a * a % mod;
    }
    return ans;
}

namespace binom {
    int fac[N], ifac[N];
    int __ = [] {
        fac[0] = 1;
        for (int i = 1; i <= N - 5; i++) {
            fac[i] = fac[i - 1] * i % mod;
        }
        ifac[N - 5] = ksm(fac[N - 5], mod - 2);
        for (int i = N - 5; i; i--) {
            ifac[i - 1] = ifac[i] * i % mod;
        }
        return 0;
    }();

    inline int C(int n, int m) {
        if (n < m || m < 0) return 0;
        return fac[n] * ifac[m] % mod * ifac[n - m] % mod;
    }

    inline int A(int n, int m) {
        if ((n < m || m < 0)) return 0;
        return fac[n] * ifac[n - m] % mod;
    }
}
using namespace binom;
struct node {
    int h[32];
    int cnt=0;
    //线性基增加了return true
    bool in(int x) {
        for (int i = 31; i >= 0; i--) {
            if ((1ll << i) & x) {
                if (h[i] == 0) {
                    h[i] = x;
                    cnt++;
                    return true;
                } else {
                    x ^= h[i];
                }
            }
        }
        return false;
    }

    int ma(int x,int y) {
        for (int i = 31; i >= 0; i--) {
            if(ans>max(x^h[i],y^h[i])){
                ans=max(x^h[i],y^h[i]);
                x^=h[i];
                y^=h[i];
            }
        }
        return x;
    }
}t1[N];

void solve() {
    int n;
    cin >> n ;
    int ans=0;
    int p=0;
    for(int i=0;i<=n;i++){
        for(int j=31;j>=0;j--){
            t1[i].h[j]=0;
        }
        t1[i].cnt=0;
    }
    vector<int>a(n+5),num(n+5),siz(n+5);
    for(int i=1;i<=n;i++){
        cin>>a[i];
        num[a[i]]++;
        if(!t1[0].in(a[i])){
            p++;
        }
    }
    ans+=ksm(2,p)-1;
    ans%=mod;
    for(int i=1;i<=n;i++){
        for(int j=2;j*i<=n;j++){
            siz[i*j]+=num[i];
            t1[i*j].in(i);
        }
    }
    //cout<<ans<<" ";
    for(int i=1;i<=n;i++){
        if(num[i]==0)continue;
        int c1=ksm(2,num[i]-1),c2=ksm(2,siz[i]-t1[i].cnt);
        //cout<<siz[i]<<" "<<i<<'\n';
        ans+=c1*c2%mod;
        ans%=mod;
        //cout<<ans<<" ";
    }
    cout <<ans << '\n';
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    // cout<<fixed<<setprecision(2);
    int T = 1;
    cin>>T;
    while (T--) solve();
    return 0;
}