#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e6 + 5, mod = 1e9 + 7;
struct node {
	int mx, cnt;
	friend node operator+(node x, node y) {
		if(x.mx != y.mx)
			return (x.mx < y.mx ? y : x);
		return node{x.mx, (x.cnt + y.cnt) % mod};
	}
};
struct Segtree {
	node tr[maxn << 2];
	void pushup(int t) {
		tr[t] = tr[t << 1] + tr[t << 1 | 1];
	}
	void build(int l, int r, int t) {
		tr[t] = {0, 0};
		if(l == r)	
			return ;
		int mid = l + r >> 1;
		build(l, mid, t << 1), build(mid + 1, r, t << 1 | 1);
	}
	void modify(int l, int r, int pos, int t, node val) {
		if(l == r) {
			tr[t] = val;
			return ;
		}
		int mid = l + r >> 1;
		if(pos <= mid)
			modify(l, mid, pos, t << 1, val);
		else
			modify(mid + 1, r, pos, t << 1 | 1, val);
		pushup(t);
	}
	node query(int l, int r, int x, int y, int t) {
		if(x <= l && r <= y)
			return tr[t];
		int mid = l + r >> 1;
		if(y <= mid)
			return query(l, mid, x, y, t << 1);
		if(mid < x)
			return query(mid + 1, r, x, y, t << 1 | 1);
		return query(l, mid, x, y, t << 1) + query(mid + 1, r, x, y, t << 1 | 1);
	}
} tree;
node prelis[maxn], prelds[maxn], suflis[maxn], suflds[maxn];
int n, a[maxn];
void solve() {
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	tree.build(1, n, 1);
	tree.modify(1, n, 1, 1, node{0, 1});
	for (int i = 1; i <= n; i++) {
		prelis[i] = tree.query(1, n, 1, a[i], 1); prelis[i].mx++;
		tree.modify(1, n, a[i], 1, prelis[i]);
	}
	tree.build(1, n, 1);
	tree.modify(1, n, n, 1, node{0, 1});
	for (int i = 1; i <= n; i++) {
		prelds[i] = tree.query(1, n, a[i], n, 1); prelds[i].mx++;
		tree.modify(1, n, a[i], 1, prelds[i]);
	}
	tree.build(1, n, 1);
	tree.modify(1, n, 1, 1, node{0, 1});
	for (int i = n; i >= 1; i--) {
		suflis[i] = tree.query(1, n, 1, a[i], 1); suflis[i].mx++;
		tree.modify(1, n, a[i], 1, suflis[i]);
	}
	tree.build(1, n, 1);
	tree.modify(1, n, n, 1, node{0, 1});
	for (int i = n; i >= 1; i--) {
		suflds[i] = tree.query(1, n, a[i], n, 1); suflds[i].mx++;
		tree.modify(1, n, a[i], 1, suflds[i]);
	}
	node lis = {0, 0}, lds = {0, 0};
	for (int i = 1; i <= n; i++)
		lis = lis + prelis[i];
	for (int i = 1; i <= n; i++)
		lds = lds + prelds[i];
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		if((prelis[i].mx + suflds[i].mx - 1 != lis.mx) || (prelds[i].mx + suflis[i].mx - 1 != lds.mx))
			continue;
	//	cout << i << " " << "Asd" << " " << prelis[i].mx << " " << suflds[i].mx << " " << prelds[i].mx << " " << suflis[i].mx << endl;
		ans += prelis[i].cnt * prelds[i].cnt % mod * suflis[i].cnt % mod * suflds[i].cnt % mod;
	}
	cout << (ans == lis.cnt * lds.cnt % mod ? lis.mx + lds.mx - 1 : lis.mx + lds.mx) << endl;
}
signed main() {
	int T; cin >> T;
	while(T--)
		solve();
	return 0;
}
/*
10 10
1 2 3 4 5 6 7 8 9 10
9 6
9 7
5 4
10 9
6 4
7 4
6 6
4 2
7 6
4 1
*/