#include <bits/stdc++.h>
using namespace std;
const int N = 2 * 1e5;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
int a[N];
int n;
int dfs(int h, int w, int s) {
  if (s > n) return h;
  int sum = 0;
  for (int i = s; i <= n; i++) {
    if (a[i] > a[i + 1]) sum++;
    if (sum == w) return dfs(h + 1, i - s + 1, i + 1);
  }
  return h + 1;
}
int main() {
  int T;
  T = read();
  while (T--) {
    n = read();
    for (int i = 1; i <= n; i++) a[i] = read();
    printf("%d\n", dfs(1, 1, 2) - 1);
  }
  return 0;
}
