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 java.io.*;
    public class Solution implements Runnable{
        FastScanner sc;
        PrintWriter pw;
        final class FastScanner {
            BufferedReader br;
            StringTokenizer st;
     
            public FastScanner() {
                try {
                    br = new BufferedReader(new InputStreamReader(System.in));
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    e.printStackTrace();
                }
            }
     
            public long nlo() {
                return Long.parseLong(next());
            }
     
            public String next() {
                if (st.hasMoreTokens()) return st.nextToken();
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    e.printStackTrace();
                }
                return st.nextToken();
            }
     
            public int ni() {
                return Integer.parseInt(next());
            }
     
            public String nli() {
                String line = "";
                if (st.hasMoreTokens()) line = st.nextToken();
                else try {
                    return br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                while (st.hasMoreTokens()) line += " " + st.nextToken();
                return line;
            }
     
            public double nd() {
                return Double.parseDouble(next());
            }
        }
        public static void main(String[] args)
        {
            new Thread(null,new Solution(),"codeforces",1<<25).start();
        }
        public void run()
        {
            sc=new FastScanner();
            pw=new PrintWriter(System.out);
           solve();
            pw.flush();
            pw.close();
        }
        public long gcd(long a,long b)
        {
            return b==0L?a:gcd(b,a%b);
        }
        public long ppow(long a,long b,long mod)
        {
            if(b==0L)
            return 1L;
            long tmp=1;
            while(b>1L)
            {
                if((b&1L)==1)
                tmp*=a;
                a*=a;
                a%=mod;
                tmp%=mod;
                b>>=1;
            }
            return (tmp*a)%mod;
        }
        public  int gcd(int x,int y)
        {
            return y==0?x:gcd(y,x%y);
        }
        //////////////////////////////////
        /////////////  LOGIC  ///////////
        ////////////////////////////////
       public void solve(){
        int t=sc.ni();
        while(t-->0)
        {
            int n=sc.ni();
            Integer[] arr=new Integer[n];
            for(int i=0;i<n;i++)
            arr[i]=sc.ni();
            int ans=0;
            for(int i=1;i<n;i++)
            {
                int x=arr[i-1]-arr[i];
                if(x>0)
                {
                    int p=0;
                    while(x>0)
                    {
                        p++;
                        x/=2;
                    }
                    ans=Math.max(ans,p);
                    arr[i]=arr[i-1];
                }
            }
            pw.println(ans);
        }

        }
    }