int imos[500001];

void solve() {
  int N, last_a;
  rd(N);

  fill(imos, imos+N, 0);
  last_a = -1;
  REP(i, N) {
    int a; rd(a);
    if (last_a >= 0) {
      imos[min(a, last_a)] += 1;
      imos[max(a, last_a)] -= 1;
    }
    last_a = a;
  }

  int best = 0, sum = 0;
  REP(i, N)
    best >?= (sum += imos[i]);

  wt(best + 1);
}
{
  int T; rd(T); REP(_, T) solve();
}