#include <bits/stdc++.h>
using namespace std;

#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define endl '\n'
#define yes cout << "yes\n"
#define no cout << "no\n"

#define rep(i,a,b) for(int i=a;i<b;++i)
#define per(i,a,b) for(int i=b-1;i>=a;--i)
#define each(x, a) for (auto& x : a)

const int INF = 1e18;
const int MOD = 1e9+7;
const int N = 2e5 + 5;

int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
int power(int a, int b, int m = MOD) {
    int res = 1;
    while (b > 0) {
        if (b & 1) res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}
int modinv(int a, int m = MOD) {
    return power(a, m - 2, m);
}

void solve() {
    int n;
    cin >> n;
    vector<int> a(n), sorted_a(n);
    rep(i, 0, n) {
        cin >> a[i];
        sorted_a[i] = a[i];
    }
    
    sort(all(sorted_a));
    int M = sorted_a[n / 2];
    
    vector<int> P_less(n + 1, 0), P_greater(n + 1, 0);
    rep(i, 0, n) {
        P_less[i + 1] = P_less[i] + (a[i] < M);
        P_greater[i + 1] = P_greater[i] + (a[i] > M);
    }
    
    vector<int> dp(n + 1, -1);
    dp[0] = 0;
    
    rep(i, 1, n + 1) {
        for (int j = (i % 2 == 1 ? 0 : 1); j < i; j += 2) {
            if (dp[j] != -1) {
                int len = i - j;
                int c_less = P_less[i] - P_less[j];
                int c_greater = P_greater[i] - P_greater[j];
                
                if (c_less <= len / 2 && c_greater <= len / 2) {
                    dp[i] = max(dp[i], dp[j] + 1);
                }
            }
        }
    }
    
    cout << dp[n] << endl;
}

int32_t main() {
    fast_io;

    int t;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}