#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using dt = array<int, 2>;

const int MOD = 1e9 + 7;

int calc(vector<int>& a, vector<int>& ids) {
  int g = 0;
  for (int e : ids) {
    g = gcd(g, a[e]);
  }
  return g;
}

void test() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
  	cin >> a[i];
  }

  ll ans = 1;
  for (int sz = 1; sz <= n; sz++) {
    ll sum = 0;
    vector<int> mask(sz, 1);
    mask.resize(n, 0);
    do {
      vector<int> ids;
      for (int i = 0; i < n; i++) {
      	if (mask[i]) ids.push_back(i);
      }
      sum += calc(a, ids);
    } while (prev_permutation(mask.begin(), mask.end()));
    ans = (ans * (sum % MOD)) % MOD;
  }
  cout << ans % MOD << "\n";
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int T = 1;  
  cin >> T;
  for (int i = 1; i <= T; i++) {
    test();
  }
  return 0;
}