You are given an array A. You can decrement any element of the array by 1. This operation can be repeated any number of times. A number is said to be missing if it is the smallest positive number which is a multiple of 2 that is not present in the array A. You have to find the maximum missing number after all possible decrements of the elements.
Input Format:
The first line of input contains T denoting number if test cases.
The first line of each test case contains N, the size of the array.
The second line of each test case contains N space seperated intergers.
Output Format:
Print the answer for each test case in a new line.
Constraints:
1≤T≤10
1≤N≤105
0≤Ai≤109
In the first sample test case, for 0 based indexing, if we decrement the A1 to 2, A4 to 4 and A5 to 6. the array becomes [1,2,3,3,4,6]. The smallest positive multiple of 2 which is not in the modified array is 8, thus the missing number is 8.
In the second sample test case, with or without decrements we can get 2 as the only multiple of 2 in the array, thus the missing number is 4.
