#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define ph push_back
using namespace std;

const int N=2e5+5,mod=998244353;
int T,n,a[N];
int base[25];
vector<int>v[N];

void clear()
{
    for(int i=1;i<=n;i++) v[i].clear();
    for(int i=20;i>=0;i--) base[i]=0;
}
int ksm(int a,int b)
{
    int res=1;
    for(;b;b>>=1)
    {
        if(b&1) res=res*a%mod;
        a=a*a%mod;
    }
    return res;
}
int mm(int x)
{
    return (x%mod+mod)%mod;
}
bool ins(int x)
{ 
    for(int i=20;i>=0;i--)
        if(x&(1ll<<i))
            if(!base[i]) { base[i]=x; return 1; }
            else x^=base[i];
    return 0;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin>>T;
    while(T--)
    {
        cin>>n;
        for(int i=1;i<=n;i++) cin>>a[i];
        sort(a+1,a+n+1);
        for(int i=1;i<=n;i++)
            for(int j=a[i];j<=n;j+=a[i]) v[j].ph(a[i]);
        int m=0;
        for(int i=1;i<=n;i++) m+=ins(a[i]);
        //cout<<m<<endl;
        int ans=mm(ksm(2ll,n-m)-1);
        //cout<<ans<<endl;
        for(int i=1;i<=n;i++)
        {
            int r=i;
            while(r+1<=n&&a[r+1]==a[i]) r++;
            m=0; memset(base,0,sizeof(base));
            for(auto it:v[a[i]]) m+=ins(it);
            int res=ksm(2ll,v[a[i]].size()-m);
            // cout<<a[i]<<' '<<res<<endl;
            ans=(ans+res)%mod;
            i=r;
        }
        cout<<ans<<endl;
        clear();
    }
    return 0;
}