#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <array>
#define FILEIO(filename) (freopen(filename ".in", "r", stdin), freopen(filename ".out", "w", stdout))
typedef long long ll;
typedef unsigned long long ull;
const int N = 200005;
int Test, n, a[N];
std::map<int, int> mp;
struct node
{
    int v, x, y;
    inline bool operator<(node b) const
    {
        return v < b.v;
    }
};
typedef std::array<node, 2> info;
inline info merge(info l, info r)
{
    info res;
    res[0] = std::max(l[0], r[0]);
    res[1] = {0, 0, 0};
    for(node i : l)
        if(i.y != res[0].y && res[1] < i)
            res[1] = i;
    for (node i : r)
        if (i.y != res[0].y && res[1] < i)
            res[1] = i;
    return res;
}
struct SgT
{
    info mx[N << 2];
    inline int ls(int x)
    {
        return x << 1;
    }
    inline int rs(int x)
    {
        return x << 1 | 1;
    }
    inline void pushup(int x)
    {
        mx[x] = merge(mx[ls(x)], mx[rs(x)]);
        return;
    }
    void build(int x, int l, int r)
    {
        mx[x] = {};
        if(l == r)
            return;
        int mid = (l + r) >> 1;
        build(ls(x), l, mid), build(rs(x), mid + 1, r);
        return;
    }
    void insert(int x, int l, int r, int p, info v)
    {
        if(l == r)
            return mx[x] = merge(mx[x], v), void(0);
        int mid = (l + r) >> 1;
        if(p <= mid)
            insert(ls(x), l, mid, p, v);
        else
            insert(rs(x), mid + 1, r, p, v);
        pushup(x);
        return;
    }
    info query(int x, int l, int r, int ql, int qr)
    {
        if(ql > qr)
            return (info){};
        if (l >= ql && r <= qr)
            return mx[x];
        int mid = (l + r) >> 1;
        info res = {};
        if (ql <= mid)
            res = merge(res, query(ls(x), l, mid, ql, qr));
        if(qr > mid)
            res = merge(res, query(rs(x), mid + 1, r, ql, qr));
        return res;
    }
} T;
int main(void)
{
    scanf("%d", &Test);
    while (Test--)
    {
        scanf("%d", &n), mp.clear();
        int cnt = 0;
        for (int i = 1, x; i <= n; ++i)
        {
            scanf("%d", &x);
            if (mp.count(x))
                x = mp[x];
            else
                x = (mp[x] = ++cnt);
            a[i] = x;
        }
        T.build(1, 0, cnt);
        for (int i = 1; i <= n;++i)
        {
            int v[2] = {}, p[2] = {};
            info now = merge(T.query(1, 0, cnt, 0, a[i] - 1), T.query(1, 0, cnt, a[i] + 1, cnt));
            v[0] = now[0].y == a[i] ? now[1].v + 1 : now[0].v + 1;
            p[0] = now[0].y == a[i] ? now[1].x : now[0].x;
            int x = a[i], y = p[0];
            if(x > y)
                std::swap(x, y);
            now = merge(T.query(1, 0, cnt, 0, x - 1), merge(T.query(1, 0, cnt, x + 1, y - 1), T.query(1, 0, cnt, y + 1, cnt)));
            v[1] = now[0].y == a[i] ? now[1].v + 1 : now[0].v + 1;
            p[1] = now[0].y == a[i] ? now[1].x : now[0].x;
            info to = {};
            to[0] = {v[0], a[i], p[0]}, to[1] = {v[1], a[i], p[1]};
            T.insert(1, 0, cnt, a[i], to);
        }
        int ans = T.query(1, 0, cnt, 0, cnt)[0].v;
        printf("%d\n", ans);
    }
    return 0;
}