This is the easy version of the problem. The difference between the versions is that in this version, you must compute a value for one sequence. You can hack only if you solved all versions of this problem. Let's define an algorithm to generate a sequence of (m+k) integers as follows: First, receive a sequence (x) of (m) integers as input. If (k=0), terminate immediately and return the sequence (x). Then, select any index (1 \le i \le |x|) and insert ((x_i+1)) immediately after the element (x_i). If (x) contains exactly (m+k) integers, terminate and return the sequence (x). Otherwise, return to the second step. Alice knows that this algorithm was used by an ancient civilization in order to hide their secrets safely. Alice wants to learn the knowledge that they wanted to hide, but it is not an easy job to infer the input from the output of the algorithm. Given a sequence (a) of (n) integers, determine the length of the shortest sequence that could be given as an input for the algorithm to generate (a). Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains a single integer (n) ((1 \le n \le 300\,000)). The second line of each test case contains (n) integers (a_1,a_2,\ldots,a_n) ((1 \le a_i \le 10^9)). It is guaranteed that the sum of (n) over all test cases does not exceed (300\,000). For each test case, output the length of the shortest sequence on a separate line. In the first test case, the sequence (1) can generate the sequence (a=1,2,3,4,5) by the following process: ()1 \to 1,\color{red}{2} \to 1,2,\color{red}{3} \to 1,2,3,\color{red}{4} \to 1,2,3,4,\color{red}{5}() In the second test case, the only sequence that can generate (a=1,3,5,7,9) is (a) itself.