#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e8;
const long double e = exp(1);
const long double pi = acos(-1.0);
int gcd(int a, int b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
long long binpows(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
long long binpow(long long a, long long b, long long m) {
  a %= m;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res;
}
const long long mod = 1e9 + 7;
void solve() {
  int n;
  cin >> n;
  vector<int> v(n);
  int dec = 0;
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  int qt = 0;
  int c = 1;
  int cant = 1;
  for (int i = 1; i < n; i++) {
    if (v[i - 1] > v[i]) {
      cant--;
    } else {
      if (i == 1) {
        cant = 0;
      }
    }
    if (cant == 0) {
      qt++;
      cant = c;
      c = 1;
    } else {
      c++;
    }
  }
  cout << qt << "\n";
}
signed main() {
  cin.tie(NULL);
  cout.tie(NULL);
  ios_base::sync_with_stdio(false);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
