/*
*/

#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <fstream>
#include <iostream>
#include <string>
#include <complex>
#include <math.h>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stdio.h>
#include <stack>
#include <algorithm>
#include <list>
#include <ctime>

#include <memory.h>
#include <assert.h>

#define y0 sdkfaslhagaklsldk

#define y1 aasdfasdfasdf
#define yn askfhwqriuperikldjk
#define j1 assdgsdgasghsf
#define tm sdfjahlfasfh
#define lr asgasgash
#define norm asdfasdgasdgsd
#define have adsgagshdshfhds
#define ends asdgahhfdsfshdshfd
#define prev asdgSHJsfgsdfhdsh

#define eps 1e-8
#define M_PI 3.141592653589793
#define bsize 512

#define ldouble long double
using namespace std;

#define bs 1000000007

const int N = 1200031;

int tests,n;
int w[N];
int ar[N];
vector<int> entries[N];

int get(int x){
    if (x==w[x])
        return x;
    return w[x]=get(w[x]);
}

void merge(int a,int b){
    a=get(a);
    b=get(b);
    w[a]=b;
}

vector<int> v;

int main(){
//    freopen("apache.in","r",stdin);
//    freopen("apache.out","w",stdout);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    ios_base::sync_with_stdio(0);
//    cin.tie(0);

    cin>>tests;
    for (;tests;--tests){
        cin>>n;
        for (int i=1;i<=n;i++){
            w[i]=i;
        }

        for (int i=1;i<=n;i++){
            cin>>ar[i];
            entries[ar[i]].push_back(i);
        }

        for (int i=2;i<=1000000;i++){
            v.clear();
            for (int j=i;j<=1000000;j+=i){
                for (int q=0;q<entries[j].size();q++){
                    v.push_back(entries[j][q]);
                }
            }
            for (int j=0;j+1<v.size();j++){
                merge(v[j],v[j+1]);
            }
        }
        int cnt=0;
        for (int i=1;i<=n;i++){
            if (get(i)==i)
                ++cnt;
        }
        long long res=1;
        for (int i=1;i<=cnt;i++){
            res=res*2%bs;
        }
        res=res+bs-2;
        cout<<res%bs<<endl;

        for (int i=1;i<=n;i++){
            entries[ar[i]].clear();
        }
    }

//    cin.get(); cin.get();
    return 0;
}