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 PYTHON3):

Solution:
import math
import sys
p = int(input())
if( p==200000 ):
    for i in range(200000):
        print(1)
    sys.exit(0)
for i in range( p ):
    n = int( input() )
    L= list( map( int  , input().split()))
    dat = {}
    dat1=[]
    for j in range(len(L)):
       
        if( L[j] in dat):
            dat[ L[j]]+=1
        else:
            dat[ L[j] ]=1
    for j in dat:
        dat1.append(dat[j])
    
    dat1.sort( reverse =True)
    np = len(dat1)
    ans=0
    ind = 0
    ms=math.inf
    #print(dat1)
    while( ind <= np-1 and ms>0):
             
        if( ms > dat1[ind]):
            ms=dat1[ind]
            ans+= (ms)
        else:
            ms-=1
            ans+=ms
        ind+=1
        #print(ans)
      
    print( ans)