#include <set>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int MAX_N = 100010;
int a[MAX_N], b[MAX_N], c[MAX_N];
int n;

bool check(int x) {
    int j = 0, k = 0;
    for (int i = 0; i < n; ++ i) if ((x>>i) & 1) {
        b[j ++] = a[i];
    } else {
        c[k ++] = a[i];
    }
    sort(b, b + j);
    k = 0;
    for (int i = j; i < n; ++ i) b[i] = c[k ++];
    for (int i = 1; i < n; ++ i) if (b[i] < b[i-1]) {
        return false;
    }
    return true;
}

int main(void) {
    int T;
    scanf("%d", &T);
    while (T -- > 0) {
        scanf("%d", &n);

        for (int i = 0; i < n; ++ i) scanf("%d", a+i);
        int ret = 100;
        for (int i = 0; i < (1<<n); ++ i) {
            if (check(i)) {
                ret = min(ret, __builtin_popcount(i));
            }
        }
        printf("%d\n", ret);
    }

    return 0;
}