Problem: This problem is actually a subproblem of problem G from the same contest.

There are n candies in a candy box. The type of the i-th candy is a_i (1 ≤ a_i ≤ n).

You have to prepare a gift using some of these candies with the following restriction: the numbers of candies of each type presented in a gift should be all distinct (i. e. for example, a gift having two candies of type 1 and two candies of type 2 is bad). 

It is possible that multiple types of candies are completely absent from the gift. It is also possible that not all candies of some types will be taken to a gift.

Your task is to find out the maximum possible size of the single gift you can prepare using the candies you have.

You have to answer q independent queries.

If you are Python programmer, consider using PyPy instead of Python when you submit your code.

Input

The first line of the input contains one integer q (1 ≤ q ≤ 2 ⋅ 10^5) — the number of queries. Each query is represented by two lines.

The first line of each query contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of candies.

The second line of each query contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ n), where a_i is the type of the i-th candy in the box.

It is guaranteed that the sum of n over all queries does not exceed 2 ⋅ 10^5.

Output

For each query print one integer — the maximum possible size of the single gift you can compose using candies you got in this query with the restriction described in the problem statement.

Example

Input


3
8
1 4 8 4 5 6 3 8
16
2 1 3 3 4 3 4 4 1 3 2 2 2 4 1 1
9
2 2 4 4 4 7 7 7 7


Output


3
10
9

Note

In the first query, you can prepare a gift with two candies of type 8 and one candy of type 5, totalling to 3 candies.

Note that this is not the only possible solution — taking two candies of type 4 and one candy of type 6 is also valid.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();
        PrintWriter pw = new PrintWriter(System.out);
        while (q-- > 0) {
            int n = sc.nextInt();
            HashMap<Integer, Integer> hm = new HashMap<>();
            for (int i = 0; i < n; i++) {
                int input = sc.nextInt();
                hm.put(input, hm.getOrDefault(input, 0) + 1);
            }
            TreeMap<Integer, Integer> tmap = new TreeMap<>(Collections.reverseOrder());
            for (Integer key : hm.keySet()) {
                Integer key1 = hm.get(key);
                tmap.put(key1, tmap.getOrDefault(key1, 0) + 1);
            }
            int maximal = tmap.firstKey();
            int sum = 0;
            for (Integer key : tmap.keySet()) {
                maximal = Math.min(key, maximal);
                int numberOfTimes = tmap.get(key);
                while (numberOfTimes > 0 && maximal > 0) {
                    sum += maximal;
                    numberOfTimes--;
                    maximal--;
                }
            }
            pw.println(sum);
        }

//            HashSet<Integer> hashSet = new HashSet<>();
//            int sum = 0;
//            for (Integer key : hm.keySet()) {
//                Integer o = hm.get(key);
//                if (!hashSet.contains(o)) {
//                    sum += o;
//                    hashSet.add(o);
//                }
//            }
        pw.flush();
        pw.close();

    }

    static class Pair implements Comparable<Pair> {
        int x;
        int y;
        int size;

        public Pair(int x, int y, int size) {
            this.x = x;
            this.y = y;
            this.size = size;
        }

        @Override
        public int compareTo(Pair o) {
            return this.size - o.size;
        }
    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream System) throws FileNotFoundException {
            br = new BufferedReader(new InputStreamReader(System));
        }

        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public String nextLine() throws IOException {
            return br.readLine();
        }

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

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

        public char nextChar() throws IOException {
            return next().charAt(0);
        }

        public Long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        public boolean ready() throws IOException {
            return br.ready();
        }

        public void waitForInput() {
            for (long i = 0; i < 3e9; i++)
                ;
        }
    }

    static class Edge implements Comparable<Edge> {
        int to;
        int index;
        int w;

        public Edge(int to, int index, int w) {
            this.to = to;
            this.index = index + 1;
            this.w = w;
        }

        @Override
        public int compareTo(Edge o) {
            return this.w - o.w;
        }
    }
}