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.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.StringTokenizer;

/**
 *
 * @author User
 */
public class CandyBox {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        int hanyszor = Integer.parseInt(st.nextToken());
        List<Integer> lista = new ArrayList<>();
        for (int i = 0; i < hanyszor; i++) {
            StringTokenizer st2 = new StringTokenizer(br.readLine());
            int hanySzam = Integer.parseInt(st2.nextToken());
            StringTokenizer st3 = new StringTokenizer(br.readLine());
            List<Integer> szamok = new ArrayList<>();
            for (int j = 0; j < hanySzam + 1; j++) {
                szamok.add(0);
            }
            for (int j = 0; j < hanySzam; j++) {
                int bemenet = (Integer.parseInt(st3.nextToken()));
                szamok.set(bemenet, szamok.get(bemenet) + 1);
            }
            System.out.println(maxCukor(hanySzam, szamok));
            lista.removeAll(lista);
        }
    }

    public static int maxCukor(int szam, List<Integer> szamok) {
        int result = 0;
        Collections.sort(szamok);
        boolean[] voltEMar = new boolean[szamok.size() + 1];
        for (int i = szamok.size() - 1; i > 0; i--) {
            int szamocska = szamok.get(i);
            if (szamocska == 0) {
                break;
            }
            if (voltEMar[szamocska] == false) {
                voltEMar[szamocska] = true;
                result += szamocska;
            } else {
                for (int j = szamocska - 1; j > 0; j--) {
                    if (voltEMar[j] == false) {
                        result += j;
                        voltEMar[j] = true;
                        break;
                    }
                }
            }

        }
        return result;
    }

}