#include <bits/stdc++.h>

#define el '\n'
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

typedef long long ll;
typedef long double ld;

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n;

bool valid(vector<int> &v) {
    int l = n, r = 0;
    for (int i = 0; i < n; i++) {
        if (v[i] != i + 1)
            l = min(l, i), r = max(r, i);
    }

    return l == n || r - l == 1;
}

void testCase() {
    cin >> n;

    vector<int> v(n);
    for (int i = 0; i < n; i++)
        cin >> v[i];

    int cnt = 0;
    while (!valid(v)) {
        for (int i = 1; i < n; i++) {
            if (v[i] < v[i - 1]) {
                swap(v[i], v[i - 1]);

                break;
            }
        }

        cnt++;
    }

    cout << cnt + 1 << el;
}

signed main() {
    Beevo

    int t = 1;
    cin >> t;

    while (t--)
        testCase();
}