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

const int mod = 1e9 + 7;

void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (auto& ai : a) {
    cin >> ai;
  }
  vector<int64_t> sum(n + 1);
  for (int mask = 0; mask < (1 << n); mask++) {
    int g = 0;
    for (int i = 0; i < n; i++) {
      if (mask & (1 << i)) {
        g = gcd(g, a[i]);
      }
    }
    sum[__builtin_popcount(mask)] += g;
  }
  int64_t mul = 1;
  for (int i = 1; i <= n; i++) {
    if (sum[i]) {
      mul = (mul * sum[i]) % mod;
    }
  }
  cout << mul << '\n';
}

int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}