#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int vis[MAXN],pw[MAXN];
vector<int>adj[MAXN];
const int N=1e6+5;
int last[N],lp[N];
int mod(ll x){x%=INF;
    if(x<0)
        x+=INF;
    return x;    
}
void dfs(int nd){
    vis[nd]=1;
    for(int i=0;i<int(adj[nd].size());i++){
        int to=adj[nd][i];
        if(!vis[to])
            dfs(to);
    }
}
int main(){
    //~ freopen("file.in", "r", stdin);
    pw[0]=1;
    for(int i=1;i<MAXN;i++)    
        pw[i]=mod(pw[i-1]+pw[i-1]);
    for(int i=2;i<N;i++){
        if(lp[i])
            continue;
        for(int j=i;j<N;j+=i)
            if(!lp[j])
                lp[j]=i;
    }
    int t;
    scanf("%d",&t);
    while(t--){
        memset(last,-1,sizeof last);
        int n;
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            int x;
            scanf("%d",&x);
            while(x>1){
                if(~last[lp[x]]){
                    adj[i].pb(last[lp[x]]);
                    adj[last[lp[x]]].pb(i);
                }
                last[lp[x]]=i;
                x/=lp[x];
            }
        }
        int cnt=0;
        for(int i=1;i<=n;i++)
            if(!vis[i]){
                dfs(i);
                cnt++;
            }    
        printf("%d\n",mod(pw[cnt]-2));    
        for(int i=1;i<=n;i++)
            adj[i].clear(),vis[i]=0;
    }
    return 0;
}