import java.util.*;
import java.io.*; 
import java.text.*;
//Solution Credits: Taranpreet Singh
public class Main{
    //SOLUTION BEGIN
    void solve(int TC) throws Exception{
        int n = ni();
        long[] h = new long[n+2];long mx = 0;
        for(int i = 1; i<= n; i++){h[i] = nl();mx = Math.max(mx, h[i]);}
        if(h[1]==mx || h[n]==mx){
            //If maximum value appear at either end, we can orient it to flow water to all N hills.
            pn(1);
            return;
        }
        //PGE = Previous greater element
        //NGE = Next greater element
        int[] pge = new int[n+2], nge = new int[n+2];
        Stack<Integer> s = new Stack<>();
        for(int i = 1; i<= n; i++){
            while(!s.isEmpty() && h[s.peek()]<h[i])
                nge[s.pop()] = i;
            s.add(i);
        }
        while(!s.isEmpty())nge[s.pop()] = n+1;
        for(int i = n; i>=1; i--){
            while(!s.isEmpty() && h[s.peek()]<h[i])
                pge[s.pop()] = i;
            s.add(i);
        }
        while(!s.isEmpty())pge[s.pop()] = 0;
        //al = answer in range [1, i] using only left side reservoir
        //ar = answer in range [i, n] using only right side reservoir
        int[] al = new int[n+2], ar = new int[n+2];
        for(int i = 1; i<= n; i++)al[i] = al[pge[i]]+1;
        for(int i = n; i>= 1; i--)ar[i] = ar[nge[i]]+1;
        int ans = n;
        for(int i = 1; i< n; i++)
            //Placing rightmost left side reservoir at index i, and leftmost right side reservoir at index i+1
            ans = Math.min(ans, 2+al[pge[i]]+ar[nge[i+1]]);
        ans = Math.min(ans, Math.min(al[n], ar[1]));
        pn(ans);
    }
    //SOLUTION ENDS
    long mod = (long)1e9+7, IINF = (long)1e17;
    final int MAX = (int)1e6+1, INF = (int)2e9, root = 3;
    DecimalFormat df = new DecimalFormat("0.000000000000");
    double PI = 3.1415926535897932384626433832792884197169399375105820974944, eps = 1e-8;
    static boolean multipleTC = true, memory = false;
    FastReader in;PrintWriter out;
    void run() throws Exception{
        in = new FastReader();
        out = new PrintWriter(System.out);
        int T = (multipleTC)?ni():1;
        //Solution Credits: Taranpreet Singh
        for(int i = 1; i<= T; i++)solve(i);
        out.flush();
        out.close();
    }
    public static void main(String[] args) throws Exception{
        if(memory)new Thread(null, new Runnable() {public void run(){try{new Main().run();}catch(Exception e){e.printStackTrace();}}}, "1", 1 << 28).start();
        else new Main().run();
    }
    long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
    int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
    int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}
    void p(Object o){out.print(o);}
    void pn(Object o){out.println(o);}
    void pni(Object o){out.println(o);out.flush();}
    String n(){return in.next();}
    String nln(){return in.nextLine();}
    int ni(){return Integer.parseInt(in.next());}
    long nl(){return Long.parseLong(in.next());}
    double nd(){return Double.parseDouble(in.next());}

    class FastReader{
        BufferedReader br;
        StringTokenizer st;
        public FastReader(){
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FastReader(String s) throws Exception{
            br = new BufferedReader(new FileReader(s));
        }

        String next(){
            while (st == null || !st.hasMoreElements()){
                try{
                    st = new StringTokenizer(br.readLine());
                }catch (IOException  e){
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        String nextLine(){
            String str = "";
            try{    
                str = br.readLine();
            }catch (IOException e){
                e.printStackTrace();
            }   
            return str;
        }
    }
}