B"Nezzar has n balls, numbered with integers 1, 2, ldots, n . Numbers a_1, a_2, ldots, a_n are written on them, respectively. Numbers on those balls form a non-decreasing sequence, which means that a_i <= q a_{i+1} for all 1 <= q i < n . Nezzar wants to color the balls using the minimum number of colors, such that the following holds. Note that a sequence with the length at most 1 is considered as a strictly increasing sequence. Please help Nezzar determine the minimum number of colors. The first line contains a single integer t ( 1 <= t <= 100 ) -- the number of testcases. The first line of each test case contains a single integer n ( 1 <= n <= 100 ). The second line of each test case contains n integers a_1,a_2, ldots,a_n ( 1 <= a_i <= n ). It is guaranteed that a_1 <= q a_2 <= q ldots <= q a_n . For each test case, output the minimum number of colors Nezzar can use. Let's match each color with some numbers. Then: In the first test case, one optimal color assignment is [1,2,3,3,2,1] . In the second test case, one optimal color assignment is [1,2,1,2,1] . "...