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 G_CandyBox {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader inp = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Solver solver = new Solver();
        solver.solve(inp, out);
        out.close();
    }

    private static class Solver {

        Comparator<Integer> fComparator = new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return -Integer.compare(o1, o2);
            }
        };

        private void solve(InputReader inp, PrintWriter out) {
            int q = inp.nextInt();
            for (int i = 0; i < q; i++) {
                int n = inp.nextInt();
                Pair[] a = new Pair[n];
                for (int j = 0; j < n; j++) a[j] = new Pair();
                for (int j = 0; j < n; j++) {
                    int val = inp.nextInt() - 1;
                    int f = inp.nextInt();
                    a[val].candies++;
                    if (f == 1) a[val].f++;
                }
                ArrayList<Pair>[] totals = new ArrayList[n+1];
                for (int j = 0; j < n + 1; j++) totals[j] = new ArrayList<>();
                for (Pair pair: a) totals[pair.candies].add(pair);

                int sum = 0, f = 0;
                PriorityQueue<Integer> pq = new PriorityQueue<>(fComparator);
                for (int j = n; j > 0; j--) {
                    for (Pair p: totals[j]) pq.add(p.f);
                    if (!pq.isEmpty()) {
                        sum += j;
                        f += Math.min(pq.poll(), j);
                    }
                }
                out.println(sum + " " + f);
            }
        }
    }

    static class Pair implements Comparable<Pair> {

        int candies = 0;
        int f = 0;

        @Override
        public int compareTo(Pair o) {
            if (candies != o.candies) return Integer.compare(candies, o.candies);
            return Integer.compare(f, o.f);
        }
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
    }
}