You have an array a of length n. For every positive integer x you are going to perform the following operation during the x-th second:

  * Select some distinct indices i_{1}, i_{2}, …, i_{k} which are between 1 and n inclusive, and add 2^{x-1} to each corresponding position of a. Formally, a_{i_{j}} := a_{i_{j}} + 2^{x-1} for j = 1, 2, …, k. Note that you are allowed to not select any indices at all.



You have to make a nondecreasing as fast as possible. Find the smallest number T such that you can make the array nondecreasing after at most T seconds.

Array a is nondecreasing if and only if a_{1} ≤ a_{2} ≤ … ≤ a_{n}.

You have to answer t independent test cases.

Input

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 single integer n (1 ≤ n ≤ 10^{5}) — the length of array a. It is guaranteed that the sum of values of n over all test cases in the input does not exceed 10^{5}.

The second line of each test case contains n integers a_{1}, a_{2}, …, a_{n} (-10^{9} ≤ a_{i} ≤ 10^{9}).

Output

For each test case, print the minimum number of seconds in which you can make a nondecreasing.

Example

Input


3
4
1 7 6 5
5
1 2 3 4 5
2
0 -4


Output


2
0
3

Note

In the first test case, if you select indices 3, 4 at the 1-st second and 4 at the 2-nd second, then a will become [1, 7, 7, 8]. There are some other possible ways to make a nondecreasing in 2 seconds, but you can't do it faster.

In the second test case, a is already nondecreasing, so answer is 0.

In the third test case, if you do nothing at first 2 seconds and select index 2 at the 3-rd second, a will become [0, 0].
import math

# решена
def task_1343_c():
    b = int(input())
    array = [int(num) for num in input().split()]

    maxPositive = 0
    minNegative = -10000000000
    res = 0

    for i in range(b):
        if array[i] < 0:
            if i != 0 and array[i - 1] >= 0:
                res += maxPositive
                maxPositive = 0
            minNegative = max(minNegative, array[i])
        else:
            if i != 0 and array[i - 1] < 0:
                res += minNegative
                minNegative = -10000000000
        maxPositive = max(maxPositive, array[i])
    
    if minNegative == -10000000000:
        res += maxPositive
    else:
        res += maxPositive + minNegative

    print(res)

# не работает от слова совсем
def task_1341_b():
    doorSize, heightLen = map(int, input().split())
    heights = [int(num) for num in input().split()]

    perf = [0 for i in range(heightLen)]
    a = 0
    for i in range(heightLen - 1):
        if i == 0:
            perf[i] = 0
        else:
            if heights[i - 1] < heights[i] and heights[i] > heights[i + 1]:
                a += 1
            perf[i] = a

    maxl = [0 for i in range(2)]
    local = [0 for i in range(2)]
    for i in range(heightLen - doorSize):
        local[0] = perf[i + doorSize]
        local[1] = i
        if maxl[0] < local[0]:
            maxl[0] = local[0]
            maxl[1] = local[1]
    
    print(maxl[0], maxl[1])

#
def task_1340_a():
    print()

#
def task_1338_a():
    n = int(input())
    inputArr = [int(num) for num in input().split()]

    max_sec = 0
    for i in range(1, n):
        local_sec = 0

        a = inputArr[i - 1] - inputArr[i]
        if a <= 0:
            continue
        else:
            b = math.floor(math.log2(a))
            local_sec = b + 1

            for j in range(b, -1, -1):
                if a < pow(2, j):
                    continue

                inputArr[i] += pow(2, j)
                a -= pow(2, j)

            if local_sec > max_sec:
                max_sec = local_sec

    print(max_sec)


a = int(input())
for i in range(a):
    task_1338_a()
