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.util.*;
import static java.lang.Math.*;
import java.io.*;
public class S {
       
      public static void main(String args[])throws IOException{
              BufferedReader br = new  BufferedReader(new InputStreamReader(System.in));
              int test = Integer.parseInt(br.readLine());
              while(test > 0){
                    test--;
                    int n = Integer.parseInt(br.readLine());
                    long a[] = new long[n];
                    StringTokenizer st = new StringTokenizer(br.readLine());
                    for(int i = 0; i < n; i++){
                        a[i] = Long.parseLong(st.nextToken());
                    }
                    solve(a, n);
                    //System.out.println(s + " " + tar);
                    //StringTokenizer st = new StringTokenizer(br.readLine());
                    //int n = Integer.parseInt(st.nextToken());
                    //int l = Integer.parseInt(st.nextToken());
                    //st = new StringTokenizer(br.readLine());
                    //int a[] = new int[n];
                    //for(int i = 0; i < n; i++){
                  //      a[i] = Integer.parseInt(st.nextToken());
                    //}
             }
      }
      
    final static int MOD = 1000000007;
    public static void solve(long a[], int n){
        int k = n-2;
        long t = 1;
        int ans = 0;
        long max = Long.MIN_VALUE;
        long dif = 0;
        for(int i = 0; i < n; i++){
            max = Math.max(max, a[i]);
            dif = Math.max(dif, max - a[i]);
        }
        int b = 0;
        while(b < dif){
           // System.out.println("!!!!  " + t);
           b += t;
            t*=2;
            ans++;
        }
        System.out.println(ans);
    }
    
    public static void sort(int a[]){
        List<Integer> l = new ArrayList<Integer>();
        for(int val : a){
            l.add(val);
        }
        Collections.sort(l);
        int k = 0;
        for(int val : l){
            a[k++] = val;
        }
    }
    
    public static boolean isPal(String s){
        int l = 0;
        int r = s.length() - 1;
        while(l <= r){
            if(s.charAt(l) != s.charAt(r)){
                return false;
            }
            l++;
            r--;
        }
        return true;
    }
    public static int gcd(int a, int b){
        if(b == 0)return a;
        return gcd(b, a%b);
    }
}