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.*;
import java.util.*;
import java.math.*;
public class work
{
    static FastReader s;;
    static int dp[];
    static PrintWriter out;
    static class pair
    {
        int a,b;
        pair(int x, int y)
        {
            a=x;
            b=y;
        }
    }
    public static void main(String[] args) throws IOException
    {
        
        s = new FastReader();
        out=new PrintWriter(System.out);
        int t = s.ni();
        while(t-- > 0)
        {
            int n = s.ni();
            Integer arr[] = iarr(n);
            int max = 0;
            for (int i = 0; i < n; i++)
            {
                max = Math.max(arr[i], max);
            }
            Integer freq[] = new Integer[max+1];
            Arrays.fill(freq, 0);
            for (int i = 0; i < n; i++)
            {
                freq[arr[i]]++;
            }
            HashSet<Integer> hs = new HashSet<>();
            Arrays.sort(freq, Collections.reverseOrder());
            int count = 0;
            int prev = freq[0];
            for (int i = 0; i <= max; i++)
            {
                if (freq[i] == 0)
                    continue;
                if (hs.contains(freq[i]))
                {
                    count += prev-1;
                    freq[i] = prev-1;
                    //continue;
                }
                else if (freq[i] > 0)
                { 
                    count += freq[i];
                    
                }
                prev = freq[i];
                if (prev <= 0)
                    break;
                hs.add(freq[i]);
            }
            println(count);
            out.flush();
        }
        out.close();

    }  
    
    /*static int gcd(int a, int b) 
    { 
      if (b == 0) 
        return a; 
      return gcd(b, a % b);  
    }

    static long lgcd(long a, long b) 
    { 
      if (b == 0) 
        return a; 
      return lgcd(b, a % b);  
    }*/

    

    static class FastReader
    {

        BufferedReader br;
        StringTokenizer st;

        public FastReader()
        {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        public FastReader(String file_name) throws IOException
        {
            br = new BufferedReader(new FileReader(file_name));
        }
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int ni()
        {
            return Integer.parseInt(next());
        }

        long nl()
        {
            return Long.parseLong(next());
        }

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            } catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
        
    }

    static void piarr(int arr[])
    {
        int n = arr.length;
        for (int i = 0; i < n; i++)
        {
            print(arr[i]+" ");
        }
        println("");
    }

    static void plarr(long arr[])
    {
        int n = arr.length;
        for (int i = 0; i < n; i++)
        {
            print(arr[i]+" ");
        }
        println("");
    }

    static void println(Object line) 
    {
        out.println(line);
    }
    static void print(Object line) 
    {
        out.print(line);
    }
    static Integer[] iarr(int n)
    {
        Integer arr[]=new Integer[n];
        for(int i = 0; i < n;i++)
            arr[i]=s.ni();
        return arr;
    }

    static Long[] larr(int n)
    {
        Long arr[]=new Long[n];
        for(int i = 0; i < n;i++)
            arr[i]=s.nl();
        return arr;
    }

    static Integer[][] i2arr(int n, int m)
    {
        Integer arr[][]=new Integer[n][m];
        for(int i = 0; i < n;i++)
            for(int j = 0; j < m;j++)
                arr[i][j]=s.ni();
        return arr;
    }

    static Long[][] l2arr(int n, int m)
    {
        Long arr[][]=new Long[n][m];
        for(int i = 0; i < n;i++)
            for(int j = 0; j < m;j++)
                arr[i][j]=s.nl();
        return arr;
    }

    static char [] nc()
    {
        String str = s.next();
        char c[] = str.toCharArray();
        return c;
    }
    static char [][] n2c(int n)
    {
        char c[][] = new char[n][];
        for (int i = 0; i < n; i++)
            c[i] = s.next().toCharArray();
        return c;
    }

}