#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

void solve() {
  int n; cin >> n;
  vector<int> a(n), inv(n); REP(i, n) cin >> a[i], --a[i];
  REP(i, n) inv[a[i]] = i;
  int seg = 1, ans = seg;
  REP(i, n) {
    if (inv[i] == 0) {
      seg += (a[1] > i ? 1 : -1);
    } else if (inv[i] == n - 1) {
      seg += (a[n - 2] > i ? 1 : -1);
    } else {
      if (a[inv[i] - 1] > i && a[inv[i] + 1] > i) {
        seg += 2;
      } else if (a[inv[i] - 1] > i || a[inv[i] + 1] > i) {
        // same
      } else {
        seg -= 2;
      }
    }
    chmax(ans, seg);
  }
  assert(seg == 1);
  cout << ans << '\n';
}

int main() {
  int t; cin >> t;
  while (t--) solve();
  return 0;
}