#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef unsigned long long ull; typedef pair<ll, ll>pi; typedef complex<double>cx;
#define int ll
#define X first
#define Y second
#define fer(i,a,n) for(int i=a;i<=n;i++)
#define ref(i,n,a) for(int i=n;i>=a;i--)
#define endl '\n'
#define mem(a,x) memset(a,x,sizeof a)
#define ac IO;int t;cin>>t;while(t--)solve()
#define AC signed main(){IO;solve();}
#define NO {cout<<"No"<<endl;return;}
#define YES {cout<<"Yes"<<endl;return;}
#define re(a) {cout<<a<<endl;return;}
#define all(v) v.begin(),v.end()
//ofstream fout("1.out", ios::out);
//ifstream fin("1.in", ios::in);
//#define cout fout
//#define cin fin
//--------------------瑞神神中神--------------------

const int N=2e5+10,MB=18,P=998244353;
int a[N],vis[N];
int n;

void init()
{
    for(int i=1;i<=n;i++)
    {
        vis[i]=0;
    }
}

int qsm(int a,int b)
{
    int ans=1;
    while(b)
    {
        if(b&1)ans=ans*a%P;
        a=a*a%P;
        b>>=1;
    }
    return ans;
}

struct xxj
{
    int p[20];
    void init()
    {
        for(int i=0;i<=MB;i++)
        {
            p[i]=0;
        }
    }

    void add(int x)
    {
        if(x==0)return;
        for(int i=MB;i>=0;i--)
        {
            if(!(x&(1ll<<i)))continue;
            if(!p[i])
            {
                p[i]=x;return;
            }
            x^=p[i];
        }
    }

    int rebuild()
    {
        int cnt=0;
        for(int i=MB;i>=0;i--)
        {
            for(int j=i-1;j>=0;j--)
                if(p[i]&(1<<j))p[i]^=p[j];
        }
        for(int i=0;i<=MB;i++)
        {
            if(p[i])cnt++;
        }
        return cnt;
    }
}X;

void solve()
{
    cin>>n;
    init();
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        vis[a[i]]++;
    }
    sort(a+1,a+n+1);
    int ans=0;
    for(int i=1;i<=n;)
    {
        int j=i;
        while(j<=n&&a[j]==a[i])j++;
        X.init();
        int sum=0;
        for(int d=1;d*d<=a[i];d++)
        {
            if(a[i]%d||d==a[i])continue;
            if(!vis[d])continue;
            X.add(d);
            sum+=vis[d];
            if(d*d!=a[i]&&a[i]/d!=a[i])
            {
                sum+=vis[a[i]/d];
                X.add(a[i]/d);
            }
        }
        int cnt=X.rebuild();
        ans=(ans+qsm(2,sum-cnt)*(j-i))%P;
        i=j;
    }
    X.init();
    for(int i=1;i<=n;i++)
    {
        X.add(a[i]);
    }
    int cnt=X.rebuild();
    ans=(ans+(qsm(2,n-cnt))-1)%P;
    cout<<ans<<'\n';
}

signed main()
{
    ac;
}