#include <bits/stdc++.h>
#define int i64

using namespace std;
using i64 = long long;

const int mod = 998244353;

template<class T>
struct linear_basis {
    vector<T> a;
    int rank;

    linear_basis(int n) {
        init(n);
        rank = 0;
    }

    void init(int n) {
        a.assign(n, T());
    }

    bool insert(int x) {
        for (int i = a.size() - 1; i >= 0; i--) {
            if ((x >> i) & 1) {
                if (!a[i]) {
                    a[i] = x;
                    rank++;
                    return true;
                } else {
                    x ^= a[i];
                }
            }
        }
        return false;
    }
};

int power(int a, int k) {
    int res = 1;
    for (; k; a = 1ll * a * a % mod, k >>= 1) {
        if (k & 1) res = 1ll * res * a % mod;
    }
    return res;
}

void solve() {
    int n;
    cin >> n;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        a[x]++;
    }

    vector<linear_basis<int>> l(n + 1, linear_basis<int>(40));
    vector<int> num(n + 1);
    for (int i = 1; i <= n; i++) {
        if (!a[i]) continue;
        for (int j = 0; j * i <= n; j++) {
            num[j * i] += a[i];
            l[j * i].insert(i);
        }
    }

    int ans = ((power(2, n - l[0].rank) - 1) % mod + mod) % mod;
    for (int i = 1; i <= n; i++) {
        if (!a[i]) continue;
        ans = (ans + power(2, num[i] - l[i].rank) % mod + mod) % mod;
    }
    cout << ans << '\n';
}

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

    int t;
    cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}