#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define endl '\n'

long long toNum(string s){
    long long num = 0;
    for(int i = 0 ; i < s.size() ; i++){
        num = (num * 10) + (s[i] - '0');
    }
    return num;
}


void solve(){
    int n;
    cin >> n;
    vector<ll> v(n);
    vector<int> tr(11);
    for(int i = 0 ; i < n ; i++){
        cin >> v[i];
        tr[i+1] = 0;
    }

    long long mod = 1e9+7, res = 1;
	
    for(int i = 0 ; i < (1 << n) ; i++){
        bitset<32> b(i);

        ll cur = 0, ct = 0;
        for(int j = n - 1;j>=0;j--){
            if(b[j] == 1){
            	ct++;
            	//cout << v[j] << " ";
                cur = __gcd(v[j], cur);
                cur %= mod;
            }
        }
        tr[ct] += cur;
    }
    for(int i = 1; i <= 10 ; i++){
    	//cout << i << " " <<  tr[i] << endl;
    	if(tr[i])    res *= tr[i];
    	res %= mod;
    }	
    cout << res << endl;
}

int main(){
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}