#include <bits/stdc++.h>
using namespace std;
long long a[500500], b[500000];
map<long long, long long> mp;
int main() {
  cin.sync_with_stdio(false);
  long long i, j, k, l, c, v, n, m, r, t;
  long long x1, x2, y1, y2, x3, x4, x5, x6;
  string s, s1, s2, s3;
  cin >> m;
  while (m--) {
    cin >> n;
    c = 0;
    v = 1e18;
    j = 0;
    mp.clear();
    for (i = 0; i < n; i++) {
      cin >> k;
      mp[k]++;
      if (mp[k] == 1) {
        a[j++] = k;
      }
    }
    for (i = 0; i < j; i++) {
      b[i] = mp[a[i]];
    }
    sort(b, b + j);
    c = 0;
    v = b[j - 1] + 1;
    for (i = j - 1; i >= 0; i--) {
      if (b[i] < v) {
        v = b[i];
        c += v;
      } else {
        v--;
        if (v == 0) break;
        c += v;
      }
    }
    cout << c << endl;
  }
}

### Prompt

Generate a Cpp solution to the following 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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long a[500500], b[500000];
map<long long, long long> mp;
int main() {
  cin.sync_with_stdio(false);
  long long i, j, k, l, c, v, n, m, r, t;
  long long x1, x2, y1, y2, x3, x4, x5, x6;
  string s, s1, s2, s3;
  cin >> m;
  while (m--) {
    cin >> n;
    c = 0;
    v = 1e18;
    j = 0;
    mp.clear();
    for (i = 0; i < n; i++) {
      cin >> k;
      mp[k]++;
      if (mp[k] == 1) {
        a[j++] = k;
      }
    }
    for (i = 0; i < j; i++) {
      b[i] = mp[a[i]];
    }
    sort(b, b + j);
    c = 0;
    v = b[j - 1] + 1;
    for (i = j - 1; i >= 0; i--) {
      if (b[i] < v) {
        v = b[i];
        c += v;
      } else {
        v--;
        if (v == 0) break;
        c += v;
      }
    }
    cout << c << endl;
  }
}

```