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

public class D_Candy_Box_easy_version_ {
    static class Point implements Comparable<Point> {
        int a, b;
        Point(int a, int b) {
            this.a = a;
            this.b = b;
        }
 
        @Override
        public int compareTo(D_Candy_Box_easy_version_.Point point) {
            if (a != point.a) return -Integer.compare(a, point.a);
            return -Integer.compare(b, point.b);
        }
    }
 
    public static void main(String[] args) {
        FastScanner fs = new FastScanner();

        int[] freq = new int[200010];
        ArrayList<Point> v =  new ArrayList<>();

        int T = fs.nextInt();

        for(int tt = 0; tt < T; ++tt) {

            int n = fs.nextInt();

            int[] a = fs.readArray(n);
            
            for(int i = 0; i < n; ++i) freq[a[i]]=0;
            for(int i = 0; i < n; ++i) freq[a[i]]++;

            v.clear();

            for(int i = 0; i < n; ++i) {
                if (freq[a[i]] > 0) {
                    v.add(new Point(freq[a[i]], a[i]));
                    freq[a[i]] = 0;
                }
            }
 
            Collections.sort(v);
 
            int ans = 0;
            int last = v.get(0).a + 1;
 
            for(int i = 0; i < v.size(); ++i) {
                if (last <= 0) break;
                last = Math.min(v.get(i).a, last - 1);
                ans += last;
            }
 
            System.out.println(ans);
        }

    }

    static void sort(int[] a) {
        ArrayList<Integer> l=new ArrayList<>();
        for (int i:a) l.add(i);
        Collections.sort(l);
        for (int i=0; i<a.length; i++) a[i]=l.get(i);
    }

    static class FastScanner {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
        int[] readArray(int n) {
            int[] a=new int[n];
            for (int i=0; i<n; i++) a[i]=nextInt();
            return a;
        }
        long nextLong() {
            return Long.parseLong(next());
        }
    }
}