B"Alice and Bob are swimming in the pool under the guidance of their instructor Monocarp. The pool can be represented as a segment on the OX-axis from 0 to 50 . Both Alice and Bob started at moment 0 at point 0 with positive real speeds v_A and v_B correspondingly. Both Alice and Bob swim from 0 to point 50 , then instantly turn back and swim from 50 to 0 . At 0 they turn back again and swim to 50 and so on. Monocarp logged all valuable info about Alice and Bob, including moments of time when they met at the same point (Alice and Bob swim on parallel lanes, so they don't bother each other). Let's name that moments of time as sequence t_1, t_2, ... , t_n . Due to some incident, Monocarp lost almost all data he recorded, and all he has now is array t . Monocarp remembers that Alice and Bob had distinct positive real swimming speeds v_A and v_B ( v_A > 0 ; v_B > 0 ; v_A neq v_B ) and that sequence t contains the first n meeting moments. But looking at sequence t he noticed that all t_i are integer values, and now he doubts is sequence t valid or there are some errors in it. Help Monocarp to check array t ! The first line contains a single integer c ( 1 <= c <= 10^4 ) -- the number of test cases. Then c cases follow. The first line of each test case contains a single integer n ( 1 <= n <= 2 cdot 10^5 ) -- the size of array t . The second line of each test case contains n integers t_1, t_2, ... , t_n ( 1 <= t_1 < t_2 < ... < t_n <= 10^9 ) -- the meeting moments in the increasing order. It's guaranteed that the sum of n over all test cases doesn't exceed 2 cdot 10^5 . For each test case, print VALID if the array t is a valid array, or (in other words) exist such real values v_A and v_B ( v_A, v_B > 0 ; v_A neq v_B ) that ar"...