#include <bits/stdc++.h>
using namespace std;
constexpr int N = 2e5 + 5, mod = 1e9 + 7;
struct Base{
    int a[20];
    void init() {
        for (int i = 0; i < 20; i++)
            a[i] = 0;
    }
    void insert(int x) {
        for (int i = 19; i >= 0; i--) {
            if (!((x >> i) & 1)) {
                continue;
            }
            if (!a[i]) {
                a[i] = x;
                break;
            }
            x ^= a[i];
        }
    }
    int count() {
        int cnt = 0;
        for (int i = 0; i < 20; i++)
            if (a[i])
                cnt++;
        return cnt;
    }
};
int n;
int pw[N];
int a[N];
int cnt[N];
vector<int> d[N];
int fac[N], inv[N];
int qpow(int a, int k) {
    int res = 1;
    while (k) {
        if (k & 1) res = 1ll * res * a % mod;
        a = 1ll * a * a % mod;
        k >>= 1;
    }
    return res;
}
void init(int n) {
    pw[0] = 1;
    for (int i = 1; i <= n; i++)
        pw[i] = 2ll * pw[i - 1] % mod;
    fac[0] = 1;
    for (int i = 1; i <= n; i++)
        fac[i] = 1ll * fac[i - 1] * i % mod;
    inv[n] = qpow(fac[n], mod - 2);
    for (int i = n - 1; i >= 0; i--)
        inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;
}
int C(int n, int m) {
    if (m < 0 || n < m) return 0;
    return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;
}
void solve() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        cnt[a[i]]++;
    }
    for (int i = 1; i <= n; i++)
        for (int j = 2 * i; j <= n; j += i)
            d[j].push_back(i);
    Base alls;
    alls.init();
    for (int i = 1; i <= n; i++)
        alls.insert(a[i]);
    int ans = pw[n - alls.count()] - 1;
    for (int i = 1; i <= n; i++) {
        if (!cnt[i]) continue;
        Base B;
        B.init();
        int sum = 0;
        for (int x : d[i]) {
            if (cnt[x]) {
                B.insert(x);
                sum += cnt[x];
            }
        }
        int res = 0;
        for (int t = 1; t <= cnt[i]; t += 2)
            res = (res + C(cnt[i], t)) % mod;
        ans = (ans + 1ll * res * pw[sum - B.count()]) % mod;
        
    }
    printf("%d\n", ans);
}
void clear() {
    for (int i = 0; i <= n; i++)
        cnt[i] = 0, d[i].clear();
}
int main() {
    init(N - 1);
    int T;
    scanf("%d", &T);
    while (T--) {
        solve();
        clear();
    }
}