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].
/* package codechef; // don't place package name! */

import java.util.*;
import java.util.regex.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
   
	public static void main (String[] args) throws java.lang.Exception
	{
	    Scanner sc= new Scanner(System.in);
	    int t=sc.nextInt();
	    while(t>0){
	        int n= sc.nextInt();
	        ArrayList<Long> arr= new ArrayList<>();
	        PriorityQueue<Long> q= new PriorityQueue<>(Collections.reverseOrder());
	        for(int i=0;i<n;i++){
	            arr.add(sc.nextLong());
	        }
	        for(int i=1;i<n;i++){
	            long a=arr.get(i-1)-arr.get(i);
	            //System.out.println(arr);
	            if(a>0){
	               long p=(long)Math.ceil(Math.log(a+1)/Math.log(2));
	               long p1=(long)(Math.log(a+1)/Math.log(2));
	               long test=(long)Math.floor(Math.log(a)/Math.log(2));
	               q.add(test+1);
	               arr.set(i,arr.get(i-1));
	               /*System.out.println(Math.log(a+1)/Math.log(2));
	               long r=(long)Math.ceil(Math.log(a)/Math.log(2));
	               if(r+1<p){
	                   System.out.println(r+" r");
	                   q.add(r+1); 
	                   long b=arr.get(i)+(long)Math.pow(2,r);
	                   arr.set(i,b);
	               }
	               else{
	                   System.out.println(p1+" p");
	                   q.add(p); 
	                   if(p1==p){
	                       long b=arr.get(i)-1+(long)Math.pow(2,(p1));
	                       arr.set(i,b);
	                   }
	                   else{
	                       long b=arr.get(i)-1+(long)Math.pow(2,(p1+1));
	                       arr.set(i,b);
	                   }
	                   }*/
	            }
	        }
	        //System.out.println(q);
	        if(q.size()==0){
	            System.out.println("0");
	        }
	        else
	            System.out.println(q.poll());
	        t--;
	    }
	   
	    }
	    	// your code goes here
	}

