#include<bits/stdc++.h>
//#define int long long
#define pii pair<int, int>
using namespace std;
const int M = 998244353;
int K = 18;
struct L{
    int n=0, rnk=0;
    int cnt = 1;
    int num[22]{};
    void add(int u){
        n++;
        for (int i = K; i >= 0;i--){
            if(u&(1<<i)){
                if(num[i])
                    u ^= num[i];
                else {
                    num[i] = u;
                    rnk++;
                    return;
                }
            }
        }
        cnt = cnt * 2 % M;
    }
    int query(int u){
        for (int i = K; i >= 0;i--){
            if(u&(1<<i)){
                if(num[i])
                    u ^= num[i];
            }
        }
        if(u==0)
            return 1;
        else
            return 0;
    }
    void insert(int a,int b){
        add(a);
        for (int i = 0; i < b - 1;i++)
            cnt = cnt * 2 % M;
    }
};
unordered_map<int, int> mp;
vector<int> di[202020];
int work(int u){
    if(u==0){
        L now;
        for(auto [a,b]:mp){
            now.insert(a, b);
        }
        return (now.cnt * now.query(0) - 1+M)%M;
    }
    else {
        L now;
        for (auto i:di[u])
            if(mp.count(i)){
                now.insert(i, mp[i]);
        }
        return now.cnt * now.query(u);
    }
}

void init(){
    for (int i = 1; i <= 200000;i++){
        for(int j = i; j <= 200000;j+=i)
            di[j].push_back(i);
    }
}

void solve(){
    int n;
    cin >> n;
    mp.clear();
    for (int i = 0; i < n;i++){
        int u;
        cin >> u;
        mp[u]++;
    }
    int ans = 0;
    for (int i = 0; i <= n;i++){
        ans += work(i);
        ans %= M;
    }
    cout << ans % M<<'\n';
}   

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    int t;
    init();
    cin >>t;
    while(t--){
        solve();
    }

    return 0;
}