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.util.Arrays;
import java.util.HashSet;
import java.util.Hashtable;
import java.util.Map.Entry;
import java.util.Random;
import java.util.StringTokenizer;
 
public class ProblemB {
	public static void main(String [] args) throws IOException{
	solve();	}
	
	
	
public static void solve() throws IOException {
	Scanner sc = new Scanner(System.in);
	int q=sc.nextInt();
	all:for(int count=0;count<q;count++) {
		int n=sc.nextInt();
		Hashtable<Integer,Integer> m = new Hashtable<Integer,Integer>();
		HashSet<Integer> h = new HashSet<Integer>();
		for(int i=0;i<n;i++) {
			int x= sc.nextInt();
			if(!m.containsKey(x)) {
				m.put(x,1);
			}else {
				m.put(x,m.get(x)+1);
			}
		}
		int l=0;
		int arr []= new int[m.size()];
		for( Integer e : m.keySet()) {
			arr[l]=m.get(e);
			l++;
		}
		shuffle(arr);
		long sum=0;
		Arrays.sort(arr);
		int j;
		for( j=0;j<arr.length;j++) {
			if(arr[j]!=0) {
				break;
			}
		}
		boolean insert=false;
		int min=Integer.MAX_VALUE;
		for(int i=arr.length-1;i>j-1 && i>-1 && min>0;i--) {
			insert=false;
			if(!h.contains(arr[i])) {
				h.add(arr[i]);
				min=arr[i];
				sum+=arr[i];
				insert=true;

			}else {
				arr[i]--;
				inner:while(arr[i]>0) {
					if(!h.contains(arr[i])) {
						h.add(arr[i]);
						sum+=arr[i];
						insert=true;
						break inner;
					}else {
						arr[i]=min;
						min--;
						arr[i]--;
					}
				}
				
			}
			if(!insert) {
				System.out.println(sum);continue all;
			}
		}
		System.out.println(sum);
		
		
	}

}
	
	
	

	
	
static void shuffle(int[] a)
{
	int n = a.length;
	for(int i = 0; i < n; i++)
	{
		int r = i + (int)(Math.random() * (n - i));
		int tmp = a[i];
		a[i] = a[r];
		a[r] = tmp;
	}
}
	
	
	
	static class Scanner {
		StringTokenizer st;
		BufferedReader br;
 
		public Scanner(InputStream s){
			br = new BufferedReader(new InputStreamReader(s));
		}
 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
		
		public long nextLong() throws IOException {return Long.parseLong(next());}
		 
				public String nextLine() throws IOException {return br.readLine();}
		 
				public double nextDouble() throws IOException
				{
					String x = next();
					StringBuilder sb = new StringBuilder("0");
					double res = 0, f = 1;
					boolean dec = false, neg = false;
					int start = 0;
					if(x.charAt(0) == '-')
					{
						neg = true;
						start++;
					}
					for(int i = start; i < x.length(); i++)
						if(x.charAt(i) == '.')
						{
							res = Long.parseLong(sb.toString());
							sb = new StringBuilder("0");
							dec = true;
						}
						else
						{
							sb.append(x.charAt(i));
							if(dec)
								f *= 10;
						}
					res += Long.parseLong(sb.toString()) / f;
					return res * (neg?-1:1);
				}
		 
				public boolean ready() throws IOException {return br.ready();}
	}
 
}