Given a sequence A = a1, a2, ..., aN.
A continuous subsequence A[L ... R] = aL, ..., aR of A is called special if for every i, j in [L, R], a[ i ] * 2 ≠ a[ j ].
For example, if A = 3, 1, 4, 6, 2.
Then
Please find the maximum length of every special contiguous subsequence of A.
The first line of the input contains a number T — the number of test cases.
The first line of each test case contains a positive integer N — the length of A.
The second line of each test case contains N positive integers — a1, a2, ..., aN.
For each test,
For each test case, print the maximum length of special contiguous subsequence.