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.InputStream;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;

import static java.lang.Math.*;
import static java.util.Collections.sort;
import static java.util.Comparator.*;

public class Main {
    FastScanner in;
    PrintWriter out;

    class Triplet {
        int a, cnt, cntf;

        Triplet(int a, int cnt, int cntf) {
            this.a = a;
            this.cnt = cnt;
            this.cntf = cntf;
        }
    }

    private void solve() throws IOException {
        int n = in.nextInt();
        int[] cnt = new int[n], cntf = new int[n];
        for (int i = 0; i < n; i++) {
            int a = in.nextInt() - 1;
            cnt[a]++;
            cntf[a] += in.nextInt();
        }

        ArrayList<Triplet> t = new ArrayList<>();
        for (int i = 0; i < n; i++)
            if (cnt[i] > 0)
                t.add(new Triplet(i, cnt[i], cntf[i]));

        sort(t, (o1, o2) -> o1.cnt != o2.cnt ? Integer.compare(o2.cnt, o1.cnt) : Integer.compare(o2.cntf, o1.cntf));

        int ans = t.get(0).cnt, ansf = t.get(0).cntf;
        PriorityQueue<Integer> pq = new PriorityQueue<>(reverseOrder());
        for (int i = 1, cntr = t.get(0).cnt - 1; cntr > 0; cntr--) {
            while (i < t.size() && t.get(i).cnt >= cntr)
                pq.add(t.get(i++).cntf);
            if (!pq.isEmpty()) {
                ans += cntr;
                ansf += min(cntr, pq.poll());
            }
        }

        out.println(ans + " " + ansf);
    }

    class FastScanner {
        StringTokenizer st;
        BufferedReader br;

        FastScanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

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

        boolean hasNext() throws IOException {
            return br.ready() || (st != null && st.hasMoreTokens());
        }

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

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

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

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

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

    private void run() throws IOException {
        in = new FastScanner(System.in); // new FastScanner(new FileInputStream(".in"));
        out = new PrintWriter(System.out); // new PrintWriter(new FileOutputStream(".out"));

        for (int t = in.nextInt(); t-- > 0; )
            solve();

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

    public static void main(String[] args) throws IOException {
        new Main().run();
    }
}