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 java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;

public class PoweredAddition { 
    int n;
    int[] a;
    public static void main(final String[] args) throws IOException {
        final BufferedReader in;
        final PrintWriter out;
        in = new BufferedReader(new InputStreamReader(System.in)); 
        out  = new PrintWriter(System.out, true);
        int t;
        t = Integer.parseInt(in.readLine());
        while(t-- > 0)  new PoweredAddition(in).solveAndPrint(out);
    }   
    PoweredAddition(final BufferedReader in) throws IOException {
        String[] strings;
        n = Integer.parseInt(in.readLine());
        strings = in.readLine().split(" ");
        a = new int[n];
        for (int i = 0; i < a.length; i++)  a[i] = Integer.parseInt(strings[i]);
    }
    void solveAndPrint(final PrintWriter out) {
        int max_x;
        max_x = 0;
        int[] max_upto;
        max_upto = new int[a.length];
        Arrays.fill(max_upto, Integer.MIN_VALUE);
        max_upto[0] = a[0];
        for (int i = 1; i < a.length; ++i)
            max_upto[i] = Math.max(a[i], max_upto[i-1]);
        for (int i = 0, x_minus1; i < a.length; ++i) {
            if(a[i] < max_upto[i]) {
                x_minus1 = (int)(Math.log10(max_upto[i]-a[i]) / Math.log10(2));
                a[i] += (1<<(x_minus1));
                max_x = Math.max(x_minus1 + 1, max_x);
            }
        }
        out.printf("%d%n", max_x);
    }
}