import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;

class Main {
	
	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		FastScanner sc=new FastScanner();
		int T=sc.nextInt();
		PrintWriter pw=new PrintWriter(System.out);
		while (T-->0) {
			int N=sc.nextInt();
			int[] P=new int[N];
			for (int i=0;i<N;++i) {
				P[i]=sc.nextInt()-1;
			}
			pw.println(solve(N, P));
		}
		pw.close();
	}
	
	long solve(int N, int[] P) {
		int[] sum=new int[N+1];
		for (int i=0;i+1<N;++i) {
			int lower=Math.min(P[i], P[i+1]);
			int upper=Math.max(P[i], P[i+1]);
			sum[lower]+=1;
			sum[upper]-=1;
		}
		for (int i=0;i+1<N;++i) {
			sum[i+1]+=sum[i];
		}
		int ans=1+Arrays.stream(sum).max().getAsInt();
		return ans;
	}
	
	static void tr(Object...objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}

class BruteForce {
	class DSU {
		int[] parent;
		
		public DSU(int n) {
			parent=new int[n];
			Arrays.fill(parent, -1);
		}
		
		int root(int x) {
			return parent[x] < 0 ? x : (parent[x] = root(parent[x]));
		}
		
		void union(int x, int y) {
			x=root(x);
			y=root(y);
			if (x==y) return;
			parent[y]+=parent[x];
			parent[x]=y;
		}
		
		boolean equiv(int x, int y) {
			return root(x) == root(y);
		}
	}
	
	int gcd(int a, int b) {
		if (a == 0) return b;
		return gcd(b%a, a);
	}
	
	boolean iscoprime(int a, int b) {
		return gcd(a, b) == 1;
	}
	
	int grundy(ArrayList<Integer> set, int mod) {
		DSU dsu=new DSU(mod);
		for (int i=1;i<mod;++i) {
			if (!iscoprime(i, mod)) continue;
			for (int a : set) {
				dsu.union(i*a%mod, i);
			}
		}
		boolean equiv = true;
		for (int i=1;i<mod;++i) if (iscoprime(i, mod)) equiv &= dsu.equiv(1, i);
		if (equiv) return 0;
		boolean[] vis=new boolean[mod];
		for (int i=1;i<mod;++i) if (iscoprime(i, mod)) {
			loop:for (int j=1;j<mod;++j) if (iscoprime(j, mod)) {
				if (!dsu.equiv(i, i*j%mod)){
					set.add(j);
					vis[grundy(set, mod)]=true;
					set.remove(set.size()-1);
					continue loop;
				}
			}
		}
		int ret=0;
		while (vis[ret]) ++ret;
		return ret;
	}

}


class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
    	return (int)nextLong();
    }
}