#include <iostream>
#include <vector>
#include <stack>
#include <unordered_map>
using namespace std;
int arr[200000 + 100];
int cpy[200000 + 100];
int up[200000 + 100];
int down[200000 + 100];
int tar[200000 + 100];
stack<pair<int, int>>mem;
unordered_map<int, bool>vis;
int main()
{
    int t;
    cin >> t;
    while (t--) {
        vis.clear();
        int n;
        int lenup = 0,lendown=0,downidx=0;
        int ans = 0;
        cin >> n;
        for (int i = 1; i <= n; i++) {
            cin >> arr[i];
        }
        for (int i = 1; i <= n; i++) {
            if (arr[i] >= up[lenup]) {
                up[++lenup] = arr[i];
                mem.push({ lenup, i });
                while (mem.size()) {
                    tar[mem.top().first] = arr[mem.top().second];
                    mem.pop();
                }
            }
            else {
                int k = lower_bound(up + 1, up + lenup + 1, arr[i]) - up;
                up[k] = arr[i];
                mem.push({ k, i });
                if (k == lenup) {
                    while (mem.size()) {
                        tar[mem.top().first] = arr[mem.top().second];
                        mem.pop();
                    }
                }
            }
        }
        for (int i = 1; i <= lenup; i++) {
            vis[tar[i]] = 1;
        }
        for (int i = 1; i <= n; i++) {
            if(vis[arr[i]]==0)
            cpy[++downidx] = arr[i];
        }
        down[0] = 1e9;
        for (int i = 1; i <= downidx; i++) {
            if (cpy[i] <= down[lendown]) {
                down[++lendown] = cpy[i];
            }
            else {
                int k = lower_bound(down + 1, down + lendown + 1, cpy[i],greater<int>()) - down;
                down[k] = cpy[i];
            }
        }
        ans = max(ans, lendown + lenup);
        ////
        lenup = 0, lendown = 0, downidx = 0;
        vis.clear();
        down[0] = 1e9;
        for (int i = 1; i <= n; i++) {
            if (arr[i] <= down[lendown]) {
                down[++lendown] = arr[i];
                mem.push({ lendown, i });
                while (mem.size()) {
                    tar[mem.top().first] = arr[mem.top().second];
                    mem.pop();
                }
            }
            else {
                int k = lower_bound(down + 1, down + lendown + 1, arr[i], greater<int>()) - down;
                down[k] = arr[i];
                mem.push({ k, i });
                if (k == lendown) {
                    while (mem.size()) {
                        tar[mem.top().first] = arr[mem.top().second];
                        mem.pop();
                    }
                }
            }
        }
        for (int i = 1; i <= lendown; i++) {
            vis[tar[i]] = 1;
        }
        for (int i = 1; i <= n; i++) {
            if (vis[arr[i]] == 0)
                cpy[++downidx] = arr[i];
        }

        for (int i = 1; i <= downidx; i++) {
            if (cpy[i] >= up[lenup]) {
                up[++lenup] = cpy[i];
            }
            else {
                int k = lower_bound(up + 1, up + lenup + 1, cpy[i]) - up;
                up[k] = cpy[i];
            }
        }
        ans = max(ans, lendown + lenup);
        cout << ans << "\n";
    }
    return 0;
}