B"Given a set of integers (it can contain equal elements). You have to split it into two subsets A and B (both of them can contain equal elements or be empty). You have to maximize the value of mex(A)+mex(B) . Here mex of a set denotes the smallest non-negative integer that doesn't exist in the set. For example: The set is splitted into two subsets A and B if for any integer number x the number of occurrences of x into this set is equal to the sum of the number of occurrences of x into A and the number of occurrences of x into B . The input consists of multiple test cases. The first line contains an integer t ( 1 <= q t <= q 100 ) -- the number of test cases. The description of the test cases follows. The first line of each test case contains an integer n ( 1 <= q n <= q 100 ) -- the size of the set. The second line of each testcase contains n integers a_1,a_2, ... a_n ( 0 <= q a_i <= q 100 ) -- the numbers in the set. For each test case, print the maximum value of mex(A)+mex(B) . In the first test case, A= <= ft {0,1,2 right },B= <= ft {0,1,5 right } is a possible choice. In the second test case, A= <= ft {0,1,2 right },B= varnothing is a possible choice. In the third test case, A= <= ft {0,1,2 right },B= <= ft {0 right } is a possible choice. In the fourth test case, A= <= ft {1,3,5 right },B= <= ft {2,4,6 right } is a possible choice. "...