The only difference between easy and hard versions is constraints.

You are given a sequence a consisting of n positive integers.

Let's define a three blocks palindrome as the sequence, consisting of at most two distinct elements (let these elements are a and b, a can be equal b) and is as follows: [\underbrace{a, a, ..., a}_{x}, \underbrace{b, b, ..., b}_{y}, \underbrace{a, a, ..., a}_{x}]. There x, y are integers greater than or equal to 0. For example, sequences [], [2], [1, 1], [1, 2, 1], [1, 2, 2, 1] and [1, 1, 2, 1, 1] are three block palindromes but [1, 2, 3, 2, 1], [1, 2, 1, 2, 1] and [1, 2] are not.

Your task is to choose the maximum by length subsequence of a that is a three blocks palindrome.

You have to answer t independent test cases.

Recall that the sequence t is a a subsequence of the sequence s if t can be derived from s by removing zero or more elements without changing the order of the remaining elements. For example, if s=[1, 2, 1, 3, 1, 2, 1], then possible subsequences are: [1, 1, 1, 1], [3] and [1, 2, 1, 3, 1, 2, 1], but not [3, 2, 3] and [1, 1, 1, 1, 2].

Input

The first line of the input contains one integer t (1 ≤ t ≤ 2000) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (1 ≤ n ≤ 2000) — the length of a. The second line of the test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 26), where a_i is the i-th element of a. Note that the maximum value of a_i can be up to 26.

It is guaranteed that the sum of n over all test cases does not exceed 2000 (∑ n ≤ 2000).

Output

For each test case, print the answer — the maximum possible length of some subsequence of a that is a three blocks palindrome.

Example

Input


6
8
1 1 2 2 3 2 1 1
3
1 3 3
4
1 10 10 1
1
26
2
2 1
3
1 1 1


Output


7
2
4
1
1
3


import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
import java.util.Stack;



public class Main {
	
	public static class FastReader {
		BufferedReader br;
		StringTokenizer st;
	

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

		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (Exception r) {
					r.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());//converts string to integer
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (Exception r) {
				r.printStackTrace();
			}
			return str;
		}
	}
	
	public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
   
  // static Scanner sc = new Scanner(in);
  
    private final static int mod = (int) (1e9+7);
    private final static int N = (int) (1e5);
    public static List<Integer>[] edges ;
    static long[][][][][] dp;
    static int n;
    static int[] ar;
    
	public static void main(String[] args) {
	 FastReader sc = new FastReader();
	  int t = sc.nextInt();
	  while(t-->0) {
		
		  int n = sc.nextInt();
		  int[] a = new int[n+1];
		  int[][] pre = new int[n+1][201];
		  List<Integer>[] list = new ArrayList[201];
		  for(int i=0;i<list.length;++i) list[i] = new ArrayList<>();
		  
		  for(int i=1;i<=n;++i) {
			  a[i] = sc.nextInt();
			  list[a[i]].add(i);
			  for(int j=1;j<=200;++j) {
				  pre[i][j] = pre[i-1][j];
				  if(j == a[i]) pre[i][j]++;
			  }
		  }
		  int ans = 0;
	      for(int i=1;i<=200;++i) {
	    	  if(list[i].size() == 0) continue;
	    	  int size = list[i].size();
	    	  ans = Math.max(ans,size);
	    	  int l = list[i].get(0),r = list[i].get(size-1);
	    	  int x = 1;
	    	  while(l < r) {
	    		  for(int j=1;j<=200;++j) {
	    			  int y = Math.max(0,pre[r-1][j] - pre[l][j]);
	    			  ans = Math.max(ans,2*x+y);
	    		  }
	    		 
	    		  l = list[i].get(x);
	    		  r = list[i].get(size-1-x);
	    		  ++x;
	    	  }
	      }
	      out.println(ans);
	  }
	  out.close();
	}

	

}