In his dream, Cocoly would go on a long holiday with no worries around him. So he would try out for many new things, such as... being a carpenter. To learn it well, Cocoly decides to become an apprentice of Master, but in front of him lies a hard task waiting for him to solve. Cocoly is given an array (a_1, a_2,\ldots, a_n). Master calls a set of integers (S) stable if and only if, for any possible (u), (v), and (w) from the set (S) (note that (u), (v), and (w) do not necessarily have to be pairwise distinct), sticks of length (u), (v), and (w) can form a non-degenerate triangle(^{\text{∗}}). Cocoly is asked to partition the array (a) into several (possibly, (1) or (n)) non-empty continuous subsegments(^{\text{†}}), such that: for each of the subsegments, the set containing all the elements in it is stable . Master wants Cocoly to partition (a) in at least two different(^{\text{‡}}) ways. You have to help him determine whether it is possible. (^{\text{∗}})A triangle with side lengths (x), (y), and (z) is called non-degenerate if and only if: (x + y > z), (y + z > x), and (z + x > y). (^{\text{†}})A sequence (b) is a subsegment of a sequence (c) if (b) can be obtained from (c) by the deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end. (^{\text{‡}})Two partitions are considered different if and only if at least one of the following holds: the numbers of continuous subsegments split in two partitions are different; there is an integer (k) such that the lengths of the (k)-th subsegment in two partitions are different. Each test contains multiple test cases. The first line of the input contains a single integer (t) ((1 \leq t \leq 200)) — the number of test cases. The description of test cases follows. The first line of each test case contain