// @rakibul-islam

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

using ll = long long;
const ll oo = 1e17;
const ll mod = 1e9 + 7;

void solve() {
  int n;  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  ll res = 1;
  ll sz[n + 1]{};
  for (int msk = 1; msk < (1 << n); msk++) {
    ll gd = 0;
    int s = 0;
    for (int i = 0; i < n; i++) if (msk & (1 << i)) {
      gd = gcd(gd, a[i]);
      s++;
    }
    sz[s] += gd;
    sz[s] %= mod;
  }
  for (int i = 1; i <= n; i++) {
    res *= sz[i];
    res %= mod;
  }
  cout << res << "\n";
} 

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t = 1;  cin >> t;
  for (int test = 1; test <= t; test++) {
    solve();
  }
  return 0;
}