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;



public class A_Power_Addition {
    public static void main(String[] args) {
        BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
        int inputNum=0,numSumI=0;
        String every_num=null;
        myArray []array;
        try{
            inputNum=Integer.parseInt(bf.readLine());//第一行输入测试个数
        }
        catch (IOException e){
            e.printStackTrace();
        }
        array=new myArray[inputNum];
        for (int i = 0; i < inputNum; i++) {
            try{
                numSumI=Integer.parseInt(bf.readLine());//本次测试数组元素个数
                every_num=bf.readLine();//读取测试元素那一行，读入为String

            }
            catch (IOException e){
                e.printStackTrace();
            }
            array[i]=new myArray(numSumI);
            String every_numS[]=every_num.split(" ");

            for (int j = 0; j < every_numS.length; j++) {
                array[i].setNum(j,Integer.parseInt(every_numS[j]));
            }
        }
        for (int i = 0; i < inputNum; i++) {
            int max,dis=0,second=1,time=1;
            if(array[i].num.length==2){
                if(array[i].num[0]<=array[i].num[1]){
                    System.out.println("0");
                    continue;
                }
                else{
                    dis=array[i].num[0]-array[i].num[1];
                    while(dis>0){
                        dis-=second;
                        second*=2;
                        time++;
                    }
                    System.out.println(time-1);
                }

            }
            else {
                max = array[i].num[0];

                for (int j = 1; j < array[i].num.length; j++) {
                    if (array[i].num[j] < max) {
                        dis = Math.max(dis, max - array[i].num[j]);
                    }
                    max = Math.max(max, array[i].num[j]);

                }
                if (dis == 0) {
                    System.out.println("0");
                    continue;
                }
                while (dis > 0) {
                    dis -= second;
                    second *= 2;
                    time++;
                }
                System.out.println(time-1);
            }

        }
        /*for (int i = 0; i < inputNum; i++) {
            int second=1;
            for (int j = 0; j < array[i].num.length-1; j++) {
                if(j!=0){
                    for (int k = 0; k < second-1; k++) {
                        if(array[i].num[j]>array[i].num[j+1]){
                            array[i].num[j+1]+=Math.pow(2,k);
                        }
                        else
                            break;
                    }
                }
                while(array[i].num[j]>array[i].num[j+1]){

                    array[i].num[j+1]+=Math.pow(2,second-1);
                    second++;
                }
            }
            System.out.println(second-1);
        }





        if(array[i].num.length==1){
                System.out.println("0");
                continue;
            }
            else if(array[i].num.length==1){
                max=Math.max(array[i].num[1],array[i].num[0]);
                dis=Math.max(max-array[i].num[1],max-array[i].num[0]);
                while(dis>0){
                    dis-=second;
                    second*=2;
                    time++;
                }
                System.out.println(time);
            }
            else{
        */
    }
}
class myArray{
    int num[];
    public myArray(int a){
        num=new int[a];
    }
    public void setNum(int j,int nums){
        num[j]=nums;
    }
}
