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.util.HashSet;
import java.util.HashMap;
import java.util.StringTokenizer;
import java.util.ArrayList;
import java.util.*;
import java.io.*;

public class Major {

    public static void addKey(HashMap<Integer, Integer>map, int key){
        if(map.containsKey(key)){
            map.put(key, map.get(key) + 1);
        } else {
            map.put(key, 1);
        }
    }

    public static void findMaxGifts(ArrayList<Node>list[], StringBuilder sb){
        PriorityQueue<Node>pq = new PriorityQueue<>();
        int currentMax = list.length - 1;

        int maxGifts = 0;
        int ones = 0;

        while(currentMax > 0){
            for(int i = 0;i < list[currentMax].size();i++){
                pq.add(list[currentMax].get(i));
            }

            if(!pq.isEmpty()) {
                Node node = pq.remove();
                maxGifts += currentMax;
                ones += Math.min(node.ones, currentMax);
            }

            --currentMax;
        }

        sb.append(maxGifts + " " + ones);
        sb.append('\n');
    }

    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int q = Integer.parseInt(br.readLine());
        StringTokenizer st;
        StringBuilder sb = new StringBuilder();

        for(int i = 1;i <= q;i++){
            int n = Integer.parseInt(br.readLine());

            HashMap<Integer, Integer>ones = new HashMap<>();
            HashMap<Integer, Integer>zeros = new HashMap<>();

            for(int j = 1;j <= n;j++){
                st = new StringTokenizer(br.readLine());
                int a = Integer.parseInt(st.nextToken());
                int f = Integer.parseInt(st.nextToken());
                if(f == 0){
                    addKey(zeros, a);
                } else {
                    addKey(ones, a);
                }
            }

            ArrayList<Node>list[] = new ArrayList[n + 1];

            for(int j = 1;j <= n;j++){
                list[j] = new ArrayList<Node>();
            }

            for(int key : ones.keySet()){
                Integer zero = zeros.get(key);

                if(zero != null){
                    list[ones.get(key) + zero].add(new Node(zero, ones.get(key)));
                } else {
                    list[ones.get(key)].add(new Node(0, ones.get(key)));
                }
            }

            for(int key : zeros.keySet()){
                Integer one = ones.get(key);

                if(one == null){
                    list[zeros.get(key)].add(new Node(zeros.get(key), 0));
                }
            }

            findMaxGifts(list, sb);
        }
        System.out.println(sb);
    }

    static class Node implements Comparable<Node>{
        int zeros;
        int ones;

        Node(int zeros, int ones){
            this.zeros = zeros;
            this.ones = ones;
        }

        public int compareTo(Node other){
            return Integer.compare(other.ones, ones);
        }
    }
}