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.util.*;
import java.io.*;
 
public class Main {
    static StringBuilder sb = new StringBuilder();
    public static void main(String[] args) throws Exception {
        FastScanner sc = new FastScanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        int T = sc.nextInt();
        for(int ti = 0; ti < T; ti++){
            int n = sc.nextInt();
            int[] cnt = new int[n];
            int[] cnt_good = new int[n];
            for(int i = 0; i < n; i++){
        		int a = sc.nextInt()-1;
        		int f = sc.nextInt();
        		cnt[a]++;
        		if(f == 1) cnt_good[a]++;
        	}
        	ArrayList<ArrayList<Integer>> types = new ArrayList<>();
        	for(int i = 0; i <= n; i++){
        	    types.add(new ArrayList<>());
        	}
        	for(int i = 0; i < n; i++){
        	    types.get(cnt[i]).add(cnt_good[i]);
        	}
        	int ans1 = 0;
        	int ans2 = 0;
        	Multiset cur = new Multiset();
        	for(int i = n; i > 0; i--){
        	    for(int x : types.get(i)){
        	        cur.offer(x);
        	    }
        		if(!cur.isEmpty()){
        			int z = cur.max();
        			ans1 += i;
        			ans2 += Math.min(i, z);
        			cur.remove(z);
        		}
        	}
        	pw.println(ans1 + " " + ans2);
        }
        pw.flush();
    }
}

class Multiset{
    private SortedMap<Integer,Integer> map;
    
    public Multiset() {
        this.map = new TreeMap<>();
    }
    
    public void offer(int elt) {
        this.map.put(elt, this.map.getOrDefault(elt, 0) + 1);
    }
 
    public void remove(int elt) {
        int newAmt = Math.max(0, this.map.getOrDefault(elt, 0) - 1);
        if (newAmt == 0) {
            this.map.remove(elt);
        } else {
            this.map.put(elt, newAmt);
        }
    }
 
    public boolean isEmpty() {
        return this.map.isEmpty();
    }
 
    public int min() {
        return this.map.firstKey();
    }
 
    public int max() {
        return this.map.lastKey();
    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;
    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
         return Double.parseDouble(next());
    }
    
    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    } 
}