#include<bits/stdc++.h>
// f[i] = max(f[j]) + 1
const int N = 2e5+5, mod = 1e9+7;
using i64 = long long;
using i128 = __int128;
int n, c[N], p[N], f[2][N], g[2][N]; i64 d[N], cntf[2][N], cntg[2][N];
void add(int x, int k, i64 cnt) {
	for(; x <= n; x += x&-x) {
		if(c[x] < k) c[x] = k, d[x] = cnt;
		else if(c[x] == k) d[x] += cnt;
	}
}
int ask1(int x) {
	int ans = 0;
	for(; x; x -= x&-x) ans = std::max(ans, c[x]);
	return ans;
}
i64 ask2(int x) {
	i64 ans = 1; int now = 0;
	for(; x; x -= x&-x) {
		if(now < c[x]) ans = d[x], now = c[x];
		else if(now == c[x]) ans += d[x];
	}
	return ans;
}
void calc(int f[], i64 cntf[]) {
	for(int i = 1; i <= n; ++i) c[i] = d[i] = f[i] = cntf[i] = 0;
	for(int i = 1; i <= n; ++i) {
		f[i] = ask1(p[i]) + 1;
		cntf[i] = ask2(p[i]);
		add(p[i], f[i], cntf[i]);
	}
}
void solve() {
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i) scanf("%d", &p[i]);
	
	// for(int i = 1; i <= n; ++i) printf("%d %lld\n", c[i], d[i]);
	// for(int i = 1 ; i <= n; ++i) printf("%d %lld\n", f[0][i], cntf[0][i]);
	calc(f[0], cntf[0]);
	std::reverse(p + 1, p + n + 1);
	calc(g[1], cntg[1]);
	std::reverse(g[1] + 1, g[1] + n + 1);
	std::reverse(cntg[1] + 1, cntg[1] + n + 1);
	for(int i = 1; i <= n; ++i) p[i] = n + 1 - p[i];
	calc(f[1], cntf[1]);
	std::reverse(f[1] + 1, f[1] + n + 1);
	std::reverse(cntf[1] + 1, cntf[1] + n + 1);
	std::reverse(p + 1, p + n + 1);
	calc(g[0], cntg[0]);
	// for(int i = 1; i <= n; ++i) printf("%d %lld %d %lld\n", f[0][i], cntf[0][i], f[1][i], cntf[1][i]);
	// puts("");
	// for(int i = 1; i <= n; ++i) printf("%d %lld %d %lld\n", g[0][i], cntg[0][i], g[1][i], cntg[1][i]);
	int LIS = 0, LDS = 0;
	for(int i = 1; i <= n; ++i) {
		LIS = std::max(LIS, f[0][i]);
		LDS = std::max(LDS, g[0][i]);
	}
	i64 numi = 0, numd = 0, num = 0;
	for(int i = 1; i <= n; ++i) {
		if(f[0][i] == LIS) numi += cntf[0][i], numi %= mod;
		if(g[0][i] == LDS) numd += cntg[0][i], numd %= mod;
		if((f[0][i] + f[1][i] - 1 == LIS) && (g[0][i] + g[1][i] - 1 == LDS)) {
			num += cntf[0][i] * cntf[1][i] % mod * cntg[0][i] * cntg[1][i] % mod;
			num %= mod;
		}
	}
	// assert(num >= 0), assert((i128)numi * numd >= 0);
	if(numi * numd % mod == num) printf("%d\n", LIS + LDS - 1);
	else printf("%d\n", LIS + LDS);
}
signed main() {
	int t;
	scanf("%d", &t);
	while(t--) solve();
	return 0;
}