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.*;


public class Main {
    static final int UNCALC = -1;
    static final int INF = (int) 1e9;
    static Pair[] a;

    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int q = sc.nextInt();
        while (q-- > 0) {
            int n = sc.nextInt();
            int[] cnt = new int[n + 1];
            int[] f = new int[n + 1];
            int m = 0;
            while (n-- > 0) {
                int x = sc.nextInt();
                cnt[x]++;
                if (cnt[x] == 1) m++;
                f[x] += sc.nextInt();
            }
            a = new Pair[m];
            n = 0;
            for (int i = 0; i < cnt.length; i++)
                if (cnt[i] != 0) a[n++] = new Pair(cnt[i], f[i]);
            Arrays.sort(a);
            Queue<Integer> take = new LinkedList<>();
            int last = cnt.length + 1;
            int sum = 0;
            for (Pair p : a) {
                last = Math.min(last - 1, p.occ);
                if (last == 0) break;
                sum += last;
                take.add(last);
            }
            int max = 0;
            PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());
            int i = 0;
            while (!take.isEmpty()) {
                int cur = take.peek();
                if (i==m || a[i].occ < cur) max += Math.min(pq.remove(), take.remove());
                else
                    pq.add(a[i++].f);
            }
            out.println(sum + " " + max);

        }
        out.flush();
        out.close();
    }


    static class Pair implements Comparable<Pair> {
        int occ, f;

        public Pair(int occ, int f) {
            this.occ = occ;
            this.f = f;
        }

        @Override
        public int compareTo(Pair o) {
            return o.occ == occ ? o.f - f : o.occ - occ;
        }

        @Override
        public String toString() {
            return "Pair{" +
                    "occ=" + occ +
                    ", f=" + f +
                    '}';
        }
    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream system) {
            br = new BufferedReader(new InputStreamReader(system));
        }

        public Scanner(String s) throws FileNotFoundException {

            br = new BufferedReader(new FileReader(new File(s)));
        }


        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public String nextLine() throws IOException {
            return br.readLine();
        }

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

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

        public char nextChar() throws IOException {
            return next().charAt(0);
        }

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

        public boolean ready() throws IOException {
            return br.ready();
        }


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

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


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

        public double[] nextDoubleArray(int n) throws IOException {
            double[] ans = new double[n];
            for (int i = 0; i < n; i++)
                ans[i] = nextDouble();
            return ans;
        }

        public short nextShort() throws IOException {
            return Short.parseShort(next());
        }

    }

}