#include <bits/stdc++.h>
using namespace std;
#define int long long
int inf = 1e9;
struct SEGm{
private:
    int n;
    vector<int> node;
public:
    SEGm(int N){
        n = N;
        node.resize(2*n+1,inf);
    }
    void update(int i, int x){
        i += n;
        node[i] = x;
        while(i > 1){
            i >>= 1;
            node[i] = min(node[i<<1],node[i<<1|1]);
        }
    }
    int f(int l, int r){
        l += n;
        r += n;
        int ans = inf;
        while(l < r){
            if(l&1) ans = min(ans,node[l++]);
            if(r&1) ans = min(ans,node[--r]);
            l >>= 1;
            r >>= 1;
        }
        return ans;
    }
};
struct SEGM{
private:
    int n;
    vector<int> node;
public:
    SEGM(int N){
        n = 1;
        while(n < N) n *= 2;
        node.resize(2*n+1,-inf);
    }
    void update(int i, int x){
        i += n;
        node[i] = max(node[i],x);
        while(i > 1){
            i >>= 1;
            node[i] = max(node[i<<1],node[i<<1|1]);
        }
    }
    int f(int l, int r){
        l += n;
        r += n;
        int ans = -inf;
        while(l < r){
            if(l&1) ans = max(ans,node[l++]);
            if(r&1) ans = max(ans,node[--r]);
            l >>= 1;
            r >>= 1;
        }
        return ans;
    }
};
signed main(){
    int TT;
    cin>>TT;
    while(TT--){
        int N;
        cin>>N;
        vector<int> H(N);
        for(int i=0;i<N;i++) cin>>H[i];
        {
            vector<pair<int,int>> S(N);
            for(int i=0;i<N;i++) S[i] = {H[i],i};
            sort(S.begin(),S.end());
            for(int i=0;i<N;i++) H[S[i].second] = i+2;
        }
        SEGM seg1(N+5);
        SEGM seg2(N+5);
        SEGM seg3(N+5);
        SEGM seg4(N+5);
        int ans = 0;
        for(int i=0;i<N;i++){
            int a = max({seg1.f(H[i],N+5)+1,1ll});
            int b = max({seg2.f(0,H[i])+1,seg1.f(H[i],N+5)+1});
            int c = max({seg3.f(H[i],N+5)+1,seg2.f(0,H[i])+1});
            int d = max({seg4.f(0,H[i])+1,seg3.f(H[i],N+5)+1});
            if(i == N-1) ans = max({ans,seg4.f(0,H[i])+1,seg4.f(H[i],N+5)});
            {
                int t = max(seg1.f(N+4,N+5),0ll);
                seg1.update(N+4,t);
            }
            {
                int t = max(seg2.f(0,1),seg1.f(0,N+5));
                seg2.update(0,t);
            }
            {
                int t = max(seg3.f(N+4,N+5),seg2.f(0,N+5));
                seg3.update(N+4,t);
            }
            {
                int t = max(seg4.f(0,1),seg3.f(0,N+5));
                seg4.update(0,t);
            }
            seg1.update(H[i],a);
            seg2.update(H[i],b);
            seg3.update(H[i],c);
            seg4.update(H[i],d);
        }
        cout<<N-ans<<endl;
    }
}