#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n;
cin >> n;
vector<int> a(n);
int g = 0;
for(int i = 0; i < n; i++) {
cin >> a[i];
g = __gcd(g, a[i]);
}
int cnt = 0;
for(int x : a) {
if(x == g) cnt++;
}
if(cnt > 0) {
cout << n - cnt << '\n';
return;
}
int best = 1e9;
for(int i = 0; i < n; i++) {
int cur = 0;
for(int j = i; j < n; j++) {
cur = __gcd(cur, a[j]);
if(cur == g) {
best = min(best, j - i + 1);
break;
}
}
}
cout << n + best - 2 << '\n';
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while(t--) solve();
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGludCBsb25nIGxvbmcKCnZvaWQgc29sdmUoKSB7CiAgICBpbnQgbjsKICAgIGNpbiA+PiBuOwoKICAgIHZlY3RvcjxpbnQ+IGEobik7CgogICAgaW50IGcgPSAwOwoKICAgIGZvcihpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBjaW4gPj4gYVtpXTsKICAgICAgICBnID0gX19nY2QoZywgYVtpXSk7CiAgICB9CgogICAgaW50IGNudCA9IDA7CgogICAgZm9yKGludCB4IDogYSkgewogICAgICAgIGlmKHggPT0gZykgY250Kys7CiAgICB9CgogICAgaWYoY250ID4gMCkgewogICAgICAgIGNvdXQgPDwgbiAtIGNudCA8PCAnXG4nOwogICAgICAgIHJldHVybjsKICAgIH0KCiAgICBpbnQgYmVzdCA9IDFlOTsKCiAgICBmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgaW50IGN1ciA9IDA7CgogICAgICAgIGZvcihpbnQgaiA9IGk7IGogPCBuOyBqKyspIHsKICAgICAgICAgICAgY3VyID0gX19nY2QoY3VyLCBhW2pdKTsKCiAgICAgICAgICAgIGlmKGN1ciA9PSBnKSB7CiAgICAgICAgICAgICAgICBiZXN0ID0gbWluKGJlc3QsIGogLSBpICsgMSk7CiAgICAgICAgICAgICAgICBicmVhazsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgIH0KCiAgICBjb3V0IDw8IG4gKyBiZXN0IC0gMiA8PCAnXG4nOwp9CgpzaWduZWQgbWFpbigpIHsKICAgIGlvczo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsKICAgIGNpbi50aWUobnVsbHB0cik7CgogICAgaW50IHQ7CiAgICBjaW4gPj4gdDsKCiAgICB3aGlsZSh0LS0pIHNvbHZlKCk7Cn0=