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.OutputStream;
import java.io.PrintWriter;
import java.util.PriorityQueue;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.AbstractCollection;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author prakharjain
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        GCandyBoxHardVersion solver = new GCandyBoxHardVersion();
        solver.solve(1, in, out);
        out.close();
    }

    static class GCandyBoxHardVersion {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int t = in.nextInt();

            while (t-- > 0) {
                int n = in.nextInt();

                int[] fa = new int[n + 1];
                int[] ffa = new int[n + 1];

                for (int i = 0; i < n; i++) {
                    int ca = in.nextInt();
                    int cf = in.nextInt();

                    fa[ca]++;

                    if (cf == 1) {
                        ffa[ca]++;
                    }
                }

                List<C> cs = new ArrayList<>();

                for (int i = 1; i <= n; i++) {
                    if (fa[i] > 0) {
                        cs.add(new C(i, fa[i], ffa[i]));
                    }
                }

                PriorityQueue<C> pq1 = new PriorityQueue<>((c1, c2) -> c2.f - c1.f);
                PriorityQueue<C> pq2 = new PriorityQueue<>((c1, c2) -> c2.ff - c1.ff);

                for (C c : cs) {
                    pq1.add(c);
                }

                int cur = pq1.peek().f;

                int aa = 0;
                int af = 0;

                while (cur > 0) {
                    while (!pq1.isEmpty() && pq1.peek().f >= cur) {
                        pq2.add(pq1.poll());
                    }

                    if (pq2.isEmpty() && !pq1.isEmpty()) {
                        cur = pq1.peek().f;
                        continue;
                    }

                    if (pq2.isEmpty()) {
                        break;
                    }

                    C cc = pq2.poll();

                    int v1 = Math.min(cc.f, cur);
                    int v2 = Math.min(cc.ff, v1);

                    aa += v1;
                    af += v2;

                    cur = v1 - 1;
                }

                out.println(aa + " " + af);
            }
        }

        class C {
            int a;
            int f;
            int ff;

            public C(int a, int f, int ff) {
                this.a = a;
                this.f = f;
                this.ff = ff;
            }

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void println(Object... objects) {
            print(objects);
            writer.println();
        }

        public void close() {
            writer.close();
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}