import math
t = int(input())
while t != 0:
n = int(input())
g = mx = 0
arr = list(map(int, input().split()))
for i in range(n):
g = math.gcd(g, arr[i])
mx = arr[n - 1] // g
print(mx)
t -= 1#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
int n, a[100010], cnt[100010];
void solve()
{
cin >> n;
int g = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
g = __gcd(a[i], g);
}
cout << a[n] / g << endl;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}
181A - Series of Crimes | 1638A - Reverse |
1654C - Alice and the Cake | 369A - Valera and Plates |
1626A - Equidistant Letters | 977D - Divide by three multiply by two |
1654B - Prefix Removals | 1654A - Maximum Cake Tastiness |
1649A - Game | 139A - Petr and Book |
1612A - Distance | 520A - Pangram |
124A - The number of positions | 1041A - Heist |
901A - Hashing Trees | 1283A - Minutes Before the New Year |
1654D - Potion Brewing Class | 1107B - Digital root |
25A - IQ test | 785A - Anton and Polyhedrons |
1542B - Plus and Multiply | 306A - Candies |
1651C - Fault-tolerant Network | 870A - Search for Pretty Integers |
1174A - Ehab Fails to Be Thanos | 1169A - Circle Metro |
780C - Andryusha and Colored Balloons | 1153A - Serval and Bus |
1487C - Minimum Ties | 1136A - Nastya Is Reading a Book |