B'One day, BThero decided to play around with arrays and came up with the following problem: You are given an array a , which consists of n positive integers. The array is numerated 1 through n . You execute the following procedure exactly once: Find and print the minimum possible value of |b| (size of b ) which can be achieved at the end of the procedure. It can be shown that under the given constraints there is at least one way to construct b . The first line of the input file contains a single integer T ( 1 <= T <= 5 cdot 10^5 ) denoting the number of test cases. The description of T test cases follows. The first line of each test contains a single integer n ( 1 <= n <= 5 cdot 10^5 ). The second line contains n space-separated integers a_1 , a_2 , ..., a_n ( 2 <= a_i <= 10^9 ). It is guaranteed that sum{n} over all test cases does not exceed 5 cdot 10^5 . For each test case, print a single line containing one integer -- the minimum possible value of |b| . '...