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 javax.swing.*;
import java.io.*;
import java.util.*;
import java.math.*;

import static java.util.Comparator.*;


public class Main {
    public static void main(String[] args) throws IOException {
        FastReader s = new FastReader();
        int t=s.nextInt();
        StringBuilder ans=new StringBuilder();
        while(t-->0) {
            int n=s.nextInt();
            long[] arr=new long[n];
            int flag=0;
            for(int i=0;i<n;i++)
            {
                arr[i]=s.nextLong();
            }

            int x=-1;
            for(int i=1;i<n;i++)
            {
                long diff=arr[i]-arr[i-1];
                if(diff<0)
                {
//                    int diff=maxArr[i]-arr[i];
                    diff=Math.abs(diff);
                    int minPow=Long.toBinaryString(diff).length()-1;
//                    System.out.println(i+" "+x+" "+minPow);
                    if(x<minPow)
                    {
                        x=minPow;
                    }

//                    System.out.println(x+" ");
                    arr[i]=arr[i-1];
//                    while(ans)
//                    System.out.println(arr[i]);
//                    x++;
                }
            }

            ans.append(x+1).append("\n");

        }
        System.out.println(ans.toString());
    }

}

class Node
{
    int val,ind;

    public Node(int val, int ind) {
        this.val = val;
        this.ind = ind;
    }
}

class FastReader
{
    BufferedReader br;
    StringTokenizer st;

    public FastReader()
    {
        br = new BufferedReader(new
                InputStreamReader(System.in));
    }

    String next()
    {
        while (st == null || !st.hasMoreElements())
        {
            try
            {
                st = new StringTokenizer(br.readLine());
            }
            catch (IOException  e)
            {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt()
    {
        return Integer.parseInt(next());
    }

    long nextLong()
    {
        return Long.parseLong(next());
    }

    double nextDouble()
    {
        return Double.parseDouble(next());
    }

    String nextLine()
    {
        String str = "";
        try
        {
            str = br.readLine();
        }
        catch (IOException e)
        {
            e.printStackTrace();
        }
        return str;
    }
}
//3
//2 1 3
//3 3 6
//99995 9998900021 999890031
//import javax.swing.*;
//import java.io.*;
//import java.util.*;
//import java.math.*;
//
//import static java.util.Comparator.*;
//
//
//public class Main {
//    static int gcd(int a, int b)
//    {
//        if (a == 0)
//            return b;
//        return gcd(b % a, a);
//    }
//    public static void main(String[] args) throws IOException {
//        FastReader s = new FastReader();
////        int t=s.nextInt();
//////        StringBuilder ans=new StringBuilder();
////        while(t-->0) {
//            int n=s.nextInt();
//            String str=s.next();
//            StringBuilder ans=new StringBuilder();
//            long count=0;
//            for(int i=0;i<n;i++)
//            {
//                char c=str.charAt(i);
//                for(int j=i+1;j<n;j++)
//                {
//                    if(str.charAt(j)==c)
//                    {
//                        continue;
//                    }
//                    for(int k=j+1;k<n;k++)
//                    {
//                        if(str.charAt(k)==str.charAt(j) || str.charAt(k)==c)
//                        {
//                            continue;
//                        }else if(Math.abs(j-i)==Math.abs(k-j))
//                        {
//                            continue;
//                        }
//                        else
//                        {
//                            count++;
//                        }
//                    }
//                }
//            }
//            System.out.println(count);
//
////        }
//    }
//
//}
//
//
//class FastReader
//{
//    BufferedReader br;
//    StringTokenizer st;
//
//    public FastReader()
//    {
//        br = new BufferedReader(new
//                InputStreamReader(System.in));
//    }
//
//    String next()
//    {
//        while (st == null || !st.hasMoreElements())
//        {
//            try
//            {
//                st = new StringTokenizer(br.readLine());
//            }
//            catch (IOException  e)
//            {
//                e.printStackTrace();
//            }
//        }
//        return st.nextToken();
//    }
//
//    int nextInt()
//    {
//        return Integer.parseInt(next());
//    }
//
//    long nextLong()
//    {
//        return Long.parseLong(next());
//    }
//
//    double nextDouble()
//    {
//        return Double.parseDouble(next());
//    }
//
//    String nextLine()
//    {
//        String str = "";
//        try
//        {
//            str = br.readLine();
//        }
//        catch (IOException e)
//        {
//            e.printStackTrace();
//        }
//        return str;
//    }
//}
////3
////2 1 3
////3 3 6
////99995 9998900021 999890031