write a go solution for Description:
You are given an array of n nonnegative integers a_1,a_2,...,a_n.

Let m be a variable that is initialized to 0, Jellyfish will perform the following operation n times:

- select an index i (1<=i<=|a|) and delete a_i from a.
- add operatornameMEX(a)^dagger to m.

Now Jellyfish wants to know the minimum possible final value of m if he performs all the operations optimally.

^dagger The MEX (minimum excluded) of an array is the smallest non-negative integer that does not belong to the array. For instance:

- The MEX of [2,2,1] is 0, because 0 does not belong to the array.
- The MEX of [3,1,0,1] is 2, because 0 and 1 belong to the array, but 2 does not.
- The MEX of [0,3,1,2] is 4 because 0, 1, 2, and 3 belong to the array, but 4 does not.

Input Format:
Each test contains multiple test cases. The first line contains the number of test cases t (1<=t<=5000). The description of the test cases follows.

The first line of each test case contains a single integer n (1<=n<=5000) — the size of the array.

The second line of each test case contains n integers a_1,a_2,...,a_n (0<=a_i<=10^9) — the integers in the array.

It is guaranteed that the sum of n over all test cases does not exceed 5000.

Output Format:
For each test case, output a single integer — the minimum value of m if the operations are performed optimally.

Note:
In the first test case, we delete elements from a in the following order: [5,2,colorred1,0,3,0,4,0]to[5,2,0,3,colorred0,4,0]to[5,2,colorred0,3,4,0]to[5,2,3,4,colorred0]to[5,2,colorred3,4]to[colorred5,2,4]to[colorred2,4]to[colorred4]to[~]. The value of m will be 1+1+1+0+0+0+0+0=3.. Output only the code with no comments, explanation, or additional text.