#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "URDL";
const long long MOD2 = (long long)1000000007 * (long long)1000000007;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
void fmain(int tid) {
  scanf("%d", &n);
  map<int, pair<int, int> > mp;
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    int f;
    scanf("%d%d", &k, &f);
    mp[k].first++;
    mp[k].second += f;
  }
  vector<pair<int, int> > vp;
  for (auto& p : mp) vp.push_back(p.second);
  sort(vp.begin(), vp.end());
  long long ans = 0, vv = 0;
  int N = vp.size();
  int pre = (1 << 30);
  vector<int> dis;
  for (int i = N - 1; i >= 0; i--) {
    int cur = max(0, min(vp[i].first, pre - 1));
    if (cur == 0) break;
    ans += cur;
    dis.push_back(cur);
    pre = cur;
  }
  multiset<int> sp;
  for (int i = N - 1, j = 0; j < dis.size(); j++) {
    while (i >= 0 && vp[i].first >= dis[j]) {
      sp.insert(vp[i].second);
      i--;
    }
    vv += min(dis[j], *sp.rbegin());
    sp.erase(sp.find(*sp.rbegin()));
  }
  printf("%lld %lld\n", ans, vv);
}
int main() {
  int t = 1;
  scanf("%d", &t);
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
