B"For an array of integers [a_1, a_2, ... , a_n] , let's call the value |a_1-a_2|+|a_2-a_3|+ cdots+|a_{n-1}-a_n| the contrast of the array. Note that the contrast of an array of size 1 is equal to 0 . You are given an array of integers a . Your task is to build an array of b in such a way that all the following conditions are met: What is the minimum possible size of the array b ? The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The first line of each test case contains a single integer n ( 1 <= n <= 3 cdot 10^5 ) -- the size of the array a . The second line contains n integers a_1, a_2, cdot, a_n ( 0 <= a_i <= 10^9 ) -- elements of the array itself. The sum of n over all test cases doesn't exceed 3 cdot 10^5 . For each test case, print a single integer -- the minimum possible size of the array b . "...