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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.BufferedInputStream;
import java.util.Collection;
import java.util.HashMap;
import java.io.IOException;
import java.util.stream.Collectors;
import java.io.InputStreamReader;
import java.io.FileNotFoundException;
import java.util.List;
import java.util.stream.Stream;
import java.util.StringTokenizer;
import java.util.Map;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in Actual solution is at the top
 *
 * @author MaxHeap
 */
public class Main {

  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    InputReader in = new InputReader(inputStream);
    PrintWriter out = new PrintWriter(outputStream);
    DCandyBoxEasyVersion solver = new DCandyBoxEasyVersion();
    int testCount = Integer.parseInt(in.next());
    for (int i = 1; i <= testCount; i++) {
      solver.solve(i, in, out);
    }
    out.close();
  }

  static class DCandyBoxEasyVersion {

    public void solve(int testNumber, InputReader in, PrintWriter out) {
      int n = in.nextInt();
      Map<Integer, Integer> count = new HashMap<>(512);
      for (int i = 0; i < n; ++i) {
        int cur = in.nextInt();
        count.put(cur, count.getOrDefault(cur, 0) + 1);
      }
      List<Integer> values = count.values()
          .stream()
          .sorted()
          .collect(Collectors.toList());
      long sum = 0;
      long cur = values.get(values.size() - 1) + 1;
      for (int i = values.size() - 1; i >= 0; --i) {
        long take = Math.max(Math.min(values.get(i), cur), 0);
        sum += take;
        cur = take - 1;
      }
      out.println(sum);
    }

  }

  static final class InputReader {

    private final BufferedReader reader;
    private StringTokenizer st;

    public InputReader() {
      reader = new BufferedReader(new InputStreamReader(
          new BufferedInputStream(System.in, 1 << 16)
      ));
      st = null;
    }

    public InputReader(InputStream in) {
      reader = new BufferedReader(new InputStreamReader(
          new BufferedInputStream(in, 1 << 16)
      ));
      st = null;
    }

    public InputReader(String filePath) {
      try {
        reader = new BufferedReader(new FileReader(filePath));
      } catch (FileNotFoundException e) {
        throw new RuntimeException(e);
      }
      st = null;
    }

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

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

  }
}