/* Problem URL: https://codeforces.com/problemset/problem/1980/D */

#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;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;


void pre()
{

}

#define TEST 1

void solve()
{
    int n;
    cin >> n;
    vl a(n);
    cin >> a;

    int wrong = -1;
    nrep(i, 1, n - 1) {
        ll cur = gcd(a[i], a[i + 1]);
        ll prev = gcd(a[i - 1], a[i]);

        if (cur < prev) {
            wrong = i;
            break;
        }
    }

    if (wrong != -1) {
        vl one(n - 1);
        vl two(n - 1);
        vl three(n - 1);

        int cur1 = 0;
        int cur2 = 0;
        int cur3 = 0;

        rep(i, n) {
            if (i != wrong - 1) {
                one[cur1] = a[i];
                cur1++;
            }

            if (i != wrong) {
                two[cur2] = a[i];
                cur2++;
            }

            if (i != wrong + 1) {
                three[cur3] = a[i];
                cur3++;
            }
        }

        auto test = [&](vl &now) {
            nrep(i, 1, now.size() - 1) {
                ll cur = gcd(now[i], now[i + 1]);
                ll prev = gcd(now[i], now[i - 1]);

                if (prev > cur) {
                    return false;
                }
            }

            return true;
        };

        if (!test(one) && !test(two) && !test(three)) {
            cout << "NO\n";
            return;
        }
    }

    cout << "YES\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}