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.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) {
		InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        int q = in.nextInt();
        for (int y = 0; y < q; y++) {
			int n = in.nextInt();
			
			HashMap<Integer, Integer> candies = new HashMap<Integer, Integer>();
			for (int i = 0; i < n; i++) {
				int aux = in.nextInt();
				if(candies.containsKey(aux))
					candies.replace(aux, candies.get(aux) + 1);
				else
					candies.put(aux, 1);
			}
			Candy[] a = new Candy[candies.size()];
			int counter = 0;
			for(Map.Entry<Integer, Integer> e : candies.entrySet()) {
				a[counter] = new Candy(e.getKey(), e.getValue());
				counter++;
			}
			Arrays.sort(a);
			int total = a[a.length-1].num;
			int last = total;
			for (int i = a.length-2; i > -1; i--) {
				int w = a[i].num;
				if(w > last) {
					w -= (w-last);
					w--;
					if(w > 0) {
						total += w;
						last = w;
					}else
						break;
				}else if(w == last){
					if(w-1 > 0) {
						total += w-1;
						last = w-1;
					}else
						break;
				}else {
					total += w;
					last = w;
				}
			}
			out.println(total);
		}
        out.close();
	}

	static class Candy implements Comparable<Candy>{
		int id;
		int num;
		
		Candy(int id, int num){
			this.id = id;
			this.num = num;
		}

		@Override
		public int compareTo(Candy a) {
			if(a.num != num)
				return num - a.num;
			return 0;
		}
		
		
	}
	
	static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

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

        public 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());
        }

    }
}