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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class practice2 {
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            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;
        }
    }
    public static FastReader scn = new FastReader();

    public static void main(String[] args) {
        int t = scn.nextInt();
        while(t-- > 0)
            run();
    }

    static class node implements Comparable<node>{
        int count;
        int poscount;

        public node(int c, int p){
            count = c;
            poscount = p;
        }


        @Override
        public int compareTo(node node) {
            if(this.count==node.count) return node.poscount - this.poscount;
            return node.count - this.count;

        }
    }

    private static void run() {
        int n = scn.nextInt();
        int[] count = new int[n+1];
        int[] poscount = new int[n+1];

        for(int i = 0; i<n;i++){
            int a = scn.nextInt();
            int b = scn.nextInt();

            count[a]++;
            if (b==1) poscount[a]++;
        }

        PriorityQueue<node> pq = new PriorityQueue<>();

        for(int i = 1; i<=n; i++){
            if(count[i]!=0){
                pq.add(new node(count[i],poscount[i]));
            }
        }

        long total = 0, fs = 0;
        int current = n;
        while(!pq.isEmpty() && current>0){
            node nn = pq.remove();
            if(nn.count>current){
                nn.count = current;
                pq.add(nn);
            }else{
                total += nn.count;
                fs += Math.min(nn.poscount,nn.count);
                current = Math.min(nn.count,current)-1;
            }
        }

        System.out.println(total + " " + fs);
    }

}