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 javax.print.DocFlavor;
import java.awt.*;
import java.io.*;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;

public class Main {

    static class pair {
        int x;
        char y;

        pair(int x, char y) {
            this.x = x;
            this.y = y;
        }


    }

    static long pow(long a, int e) {
        long res = 1;
        while (e > 0) {
            res *= a;
            e--;
        }
        return res;
    }

    static char next(char c) {
        if (c == 'R')
            return 'G';
        if (c == 'G')
            return 'B';
        return 'R';
    }

    static int[] R, G, B;
    static char[] c;

    static pair compare(char[] u, int beg, int end) {
        int ans = 0;
        for (int j = beg; j <= end; j++) {
            if (c[j] != u[j - beg]) {
                ans++;
            }
        }
        return new pair(ans, u[end]);
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st;
        PrintWriter out = new PrintWriter(System.out);
        int q = Integer.parseInt(br.readLine());
        for (int i = 0; i <q ; i++) {
            st=new StringTokenizer(br.readLine());
            int n=Integer.parseInt(st.nextToken());
            int[]arr=new int[n+1];
            st=new StringTokenizer(br.readLine());
            for (int j = 0; j <n ; j++) {
                arr[Integer.parseInt(st.nextToken())]++;
            }
            ArrayList<Integer>a=new ArrayList<>();
            for (int j = 0; j < arr.length; j++) {
                if(arr[j]!=0)
                    a.add(arr[j]);
            }
            Collections.sort(a);
            HashSet<Integer>hs=new HashSet<>();
            long max=a.get(a.size()-1);
            long akbar=max-1;
            for (int j = a.size()-2; j >=0 &&akbar>0; j--) {
               if(a.get(j)>=akbar){
                   max+=akbar;
                   akbar--;
               }
               else {
                   max+=a.get(j);
                   akbar=a.get(j)-1;
               }



            }
            out.println(max);

        }
        out.flush();
    }
}