#include <stdio.h>
#include <algorithm>
using namespace std;
#define LIM 1111

int a[LIM];
int ans[LIM][LIM];
int n;

int main() {
    int z;
    scanf("%d", &z);
    while (z--) {
        scanf("%d", &n);
        for (int i = 0; i < n; i++) scanf("%d", a + i);
        for (int j = 0; j < n; j++) {
            ans[j+1][j] = 0;
            for (int i = j; i >= 0; i--) {
                int l, g;
                l = g = 0;
                for (int k = 0; k < i; k++) l += a[k] < a[i], g += a[k] > a[i];
                for (int k = j+1; k < n; k++) l += a[k] < a[i], g += a[k] > a[i];
                ans[i][j] = ans[i+1][j] + min(l, g);
                l = g = 0;
                for (int k = 0; k < i; k++) l += a[k] < a[j], g += a[k] > a[j];
                for (int k = j+1; k < n; k++) l += a[k] < a[j], g += a[k] > a[j];
                ans[i][j] = min(ans[i][j], ans[i][j-1] + min(l, g));
            }
        }
        printf("%d\n", ans[0][n-1]);
    }
}