Nezzar has n balls, numbered with integers 1, 2, …, n. Numbers a_1, a_2, …, a_n are written on them, respectively. Numbers on those balls form a non-decreasing sequence, which means that a_i ≤ a_{i+1} for all 1 ≤ i < n.

Nezzar wants to color the balls using the minimum number of colors, such that the following holds.

  * For any color, numbers on balls will form a strictly increasing sequence if he keeps balls with this chosen color and discards all other balls. 



Note that a sequence with the length at most 1 is considered as a strictly increasing sequence.

Please help Nezzar determine the minimum number of colors.

Input

The first line contains a single integer t (1 ≤ t ≤ 100) — the number of testcases. 

The first line of each test case contains a single integer n (1 ≤ n ≤ 100).

The second line of each test case contains n integers a_1,a_2,…,a_n (1 ≤ a_i ≤ n). It is guaranteed that a_1 ≤ a_2 ≤ … ≤ a_n.

Output

For each test case, output the minimum number of colors Nezzar can use.

Example

Input


5
6
1 1 1 2 3 4
5
1 1 2 2 3
4
2 2 2 2
3
1 2 3
1
1


Output


3
2
4
1
1

Note

Let's match each color with some numbers. Then:

In the first test case, one optimal color assignment is [1,2,3,3,2,1].

In the second test case, one optimal color assignment is [1,2,1,2,1].
import java.util.*;

import javax.tools.DocumentationTool.Location;

// import org.graalvm.compiler.graph.spi.Canonicalizable.Binary;

import java.io.*;

public class sol {

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

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

        public FastReader(String giveMeFile) throws IOException {
            File file = new File("input.txt");
            br = new BufferedReader(new FileReader(file));
        }

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

        int nextInt() {
            return Integer.parseInt(next());
        }

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

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

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

    public static boolean[] SES(int n) {
        // SES Stands for SieveOfEratoSthenes
        boolean isPrime[] = new boolean[n + 1];
        Arrays.fill(isPrime, true);

        isPrime[0] = false;
        isPrime[1] = false;
        for (int i = 2; i * i <= n; i++) {
            for (int j = 2 * i; j <= n; j += i) {
                isPrime[j] = false;
            }

        }
        return isPrime;
    }

    public static int gcd(int a, int b) {
        return a % b == 0 ? b : gcd(b, a % b);
    }

    public static long fastPower(int a, int b, int n) {
        int res = 1;
        while (b > 0) {
            if ((b & 1) != 0) {
                res = (res % n * a % n) % n;
            }

            a = (a % n * a % n) % n;
            b = b >> 1; // dividing by 2
        }
        return res;
    }

    public static int first(int arr[], int low, int high, int x, int n) {
        if (high >= low) {
            int mid = low + (high - low) / 2;
            if ((mid == 0 || x > arr[mid - 1]) && arr[mid] == x)
                return mid;
            else if (x > arr[mid])
                return first(arr, (mid + 1), high, x, n);
            else
                return first(arr, low, (mid - 1), x, n);
        }
        return -1;
    }

    public static int last(int arr[], int low, int high, int x, int n) {
        if (high >= low) {
            int mid = low + (high - low) / 2;
            if ((mid == n - 1 || x < arr[mid + 1]) && arr[mid] == x)
                return mid;
            else if (x < arr[mid])
                return last(arr, low, (mid - 1), x, n);
            else
                return last(arr, (mid + 1), high, x, n);
        }
        return -1;
    }

    public static long sumPair(int arr[], int n) {
        long sum = 0;
        for (int i = n - 1; i >= 0; i--)
            sum += i * arr[i] - (n - 1 - i) * arr[i];

        return sum;
    }

    static int countRect(int n) {
        int ans = 0;

        return ans;
    }

    static void reverseArray(int a[], int start, int end) {
        while (end >= start) {
            int temp = a[start];
            a[start] = a[end];
            a[end] = temp;
            start++;
            end--;
        }
    }

    static int SE(int N) {
        // Sieve of eratosthenes method
        int[] arr = new int[N + 1];
        for (int i = 2; i * i <= N; i++) {
            if (arr[i] == 0)
                for (int j = 2 * i; j <= N; j += i)
                    arr[j]++;

            arr[i] = 1;
        }

        int max = arr[0];
        for (int i = 1; i < arr.length; i++)
            if (arr[i] > max)
                max = arr[i];

        return max;

        // Return maximum element in arr[]
        // return getMax(arr);
    }

    public static void main(String[] args) throws IOException {

        // ************** Providing input File
        // File file = new File("input.txt");
        // BufferedReader br = new BufferedReader(new FileReader(file));

        // *************** Input for Online Judges with Buffered Reader
        // BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        // ************* Input for Online Judges with Scanner class
        // Reading with Scanner class
        // Scanner sc = new Scanner(file);
        // sc.useDelimiter("\\Z");

        // ***************** Printing Outout to output file.
        // PrintWriter printWriter = new PrintWriter(new BufferedWriter(new
        // FileWriter("output.txt")));
        // printWriter.println("something here");
        // printWriter.close(); --->> // only this close method will flush the output
        // from the buffer to the output file.

        FastReader read = new FastReader();

        int q = read.nextInt();
        while (q-- != 0) {

            int n = read.nextInt();
            int a[] = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = read.nextInt();
            int maxCount = 0;
            HashMap<Integer, Integer> map = new HashMap<>();

            for (int x : a) {
                if (map.containsKey(x)) {
                    map.put(x, map.get(x) + 1);
                } else {
                    map.put(x, 1);
                }
            }

            for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
                if ((int) entry.getValue() > maxCount) {
                    maxCount = (int) entry.getValue();
                }
            }

            System.out.println(maxCount);

        }

    }
}
