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 D {

    static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
    static MyScanner sc = new MyScanner();

    public static void main(String[] args) {
        doTask();
        out.flush();
    }

    public static void doTask(){
        int q = sc.nextInt();
        int[] v = new int[200001];
        while (q-->0) {
            int n = sc.nextInt();
            for (int i =0 ; i<n;i++) v[i] =0;
            int notEmpty = 0;
            int index = -1;
            Map<Integer, Integer> sizesMap = new HashMap<>();
            for (int i =0; i<n;i++) {
                index = sc.nextInt();
                v[index]++;
                if (!sizesMap.containsKey(index)) {
                    notEmpty++;
                    sizesMap.put(index, 0);
                }
                sizesMap.put(index, sizesMap.get(index) + 1);
            }

            int[] sizes = new int[notEmpty];
            int szIndex = 0;
            for (Integer size : sizesMap.values()) {
                sizes[szIndex] = size;
                szIndex++;
            }
            Arrays.sort(sizes);
            int last = sizes[notEmpty - 1];
            int cnt = 1;
            Set<Integer> usedSizes = new HashSet<Integer>();
            usedSizes.add(last);
            for (int i = notEmpty - 2; i>=0; i--) {
                if (sizes[i] != last) {
                    cnt = 0;
                    last = sizes[i];
                }
                while (sizes[i] - cnt > 0 && usedSizes.contains(sizes[i]-cnt)) {
                    cnt++;
                }
                usedSizes.add(sizes[i]-cnt);
                sizes[i] = Math.max(0, sizes[i] - cnt);
            }

            Arrays.sort(sizes);
            int result = sizes[0];
            last = sizes[0];
            for (int i = 1; i < notEmpty; i++) {
                if (last != sizes[i]) {
                    last = sizes[i];
                    result += last;
                }
            }
            out.println(result);
        }
    }

    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

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

        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;
        }

    }
}