A

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define nl '\n'
#define sz(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define rall(s)  s.rbegin(), s.rend()
#define getline(s) getline(cin>>ws,s)
#define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define pi  3.141592653589793
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define multi_ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>


void Fast_IO(){
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
// freopen("filename.in", "r", stdin);
// freopen("filename.txt", "w", stdout);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

int dx[] = { 2, 1, -1, -2, -2, -1, 1, 2 };
int dy[] = { 1, 2, 2, 1, -1, -2, -2, -1 };

bool good(vector<ll>&v){
    ll GCD = 0;
    for(int i = 0;i < sz(v);i++){
        GCD = __gcd(GCD,v[i]);
    }
    return GCD == 1;
}



void solve(){

    ll n; cin>>n;
    vector<ll> v(n);
    ll cost = LONG_LONG_MAX;
    bool one = 0;
    for(int i=0;i<n;i++) cin>>v[i], one |= v[i] == 1;
    if(one) return cout<<0<<nl, void();

    for(int i=0; i<(1<<n); i++){
        vector<ll> tmp = v;
        ll cur_cost = 0;
        for(int j=0; j<n; j++){
            if(i&(1<<j)){
                tmp[j] = gcd(tmp[j],j+1);
                cur_cost += n-j;
            }
        }
        if(good(tmp)){
            cost = min(cost,cur_cost);
        }
    }
cout<<cost<<nl;


}

int main(){
    Fast_IO();
int t =1;
cin>>t;
while(t--){
solve();
}
return 0;
}