#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <set>
#include <cmath>
#include <map>

#define mp make_pair
#define pb push_back
#define xx first
#define yy second
using namespace std;

int a[100];
vector<pair<int, int> > b;
int main() {
  
  int T, n, m;
  scanf("%d", &T);
  while(T--) {
    scanf("%d", &n);
    
    for(int i=1;i<=n;i++) scanf("%d", &a[i]);
    int cnt = 0;
    b.clear();
    while(true) {
      for(int i=2;i<=n;i++) {
    for(int j=1;j<i;j++) {
      if(a[i] < a[j]) {
        b.pb(mp(a[i], i));
        break;
      }
    }
      }

      if(b.size()==0) break;
      cnt ++;
      sort(b.begin(), b.end());
      int x = a[b[b.size()-1].yy];
      for(int j=b[b.size()-1].yy;j>1;j--) 
    a[j] = a[j-1];
      a[1] = x;
      //      for(int i=1;i<=n;i++) cout << a[i] << " ";
      //      cout << endl;
      b.clear();
    }
    cout <<cnt << endl;
  }
}