#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

vector<int> sieve(int n) {
  vector<int> p(n);p[2]=2;
  for(int i=3;i<n;i+=2)p[i]=i;
  for(int i=3;i*i<n;i+=2)if(p[i])for(int j=i*i;j<n;j+=i)p[j]=0;
  p.erase(remove(p.begin(), p.end(), 0), p.end());
  return p;
}

vector<int> q;
vector<P> calc(ll x) {
  vector<P> v;
  rep(i,q.size()) {
    if(q[i]*q[i]>x) break;
    P p=P(q[i],0);
    while(x%q[i]==0) {
      p.S++;
      x/=q[i];
    }
    if(p.S) v.pb(p);
  }
  if(x>1) v.pb(P(x,1));
  return v;
}

int p[100001],r[100001];
void init(){rep(i,100001)p[i]=i,r[i]=0;}
int find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}
void unite(int x,int y) {
  x=find(x),y=find(y);
  if(x==y)return;
  if(r[x]<r[y])p[x]=y;
  else{p[y]=x;if(r[x]==r[y])r[x]++;}
}
bool same(int x,int y){return find(x)==find(y);}

int d[1000001];

void Main() {
  q=sieve(1000001);
  int T;
  R T;
  while(T--) {
    memset(d,-1,sizeof(d));
    init();
    ll n;
    R n;
    ll a[n];
    rep(i,n) R a[i];
    vector<P> v[n];
    rep(i,n) v[i]=calc(a[i]);
    rep(i,n) {
      rep(j,v[i].size()) {
        if(d[v[i][j].F]==-1) d[v[i][j].F]=i;
        else unite(d[v[i][j].F],i);
      }
    }
    ll cnt=0;
    rep(i,n) {
      if(find(i)==i) cnt++;
    }
    ll ans=1;
    rep(i,cnt) {
      ans*=2;
      ans%=MAX;
    }
    pr((ans-2+MAX)%MAX);
  }
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}