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.*;
import java.util.*;

public class Equal {
    static class pair implements Comparable<pair> {
        int x;
        long value;

        public pair(int xx, long modd) {
            x = xx;
            value = modd;
        }

        public int compareTo(pair o) {
            if (value < o.value)
                return -1;
            if (value > o.value)
                return 1;
            return 0;
        }

        @Override
        public boolean equals(Object obj) {
            return x == ((pair) obj).x && value == ((pair) obj).value;
        }
    }

    //    static long mem[][][];
//    static long in[][];
//    static int N, K;
//
//    static long dp(int i, int j, int p) {
//        if (i >= N)
//            return 0;
//        if (j >= K)
//            return 0;
//        if (p <= 0)
//            return 0;
//        if (mem[i][j][p] != -1)
//            return mem[i][j][p];
//        return mem[i][j][p] = Math.max(in[i][j] + dp(i, j + 1, p - 1), Math.max(dp(i + 1, 0, p), in[i][j] + dp(i + 1, 0, p - 1)));
//    }
    static boolean[] vis;

    static HashSet<String> hs;
    static ArrayList<Integer>[] tree;

    static pair[] in;
    static int[] ans;

    static void dfs(int u) {
        vis[u] = true;

        for (int i = 0; i < tree[u].size(); i++) {
            if (!vis[tree[u].get(i)]) {
                hs.add("" + u + " " + tree[u].get(i));
                hs.add(tree[u].get(i) + " " + u);
                dfs(tree[u].get(i));
                break;
            }
        }
    }


    public static void main(String[] args) throws IOException {
        //BufferedReader br=new BufferedReader(new FileReader("input.txt"));
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st;
        PrintWriter out = new PrintWriter(System.out);
        long t = Integer.parseInt(br.readLine());
        while (t-- > 0) {
            int n = Integer.parseInt(br.readLine());
            st = new StringTokenizer(br.readLine());
            pair[] arr = new pair[n];
            Long[]in=new Long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = new pair(i,Long.parseLong(st.nextToken()));
                in[i]=arr[i].value;
            }
            Arrays.sort(arr);
            long maxDiff=0;
            int indxInSorted=n-1;
            for (int i = n-1; i >=0 ; i--) {
                long currentin=in[i];
                while (indxInSorted>=0&&arr[indxInSorted].x>i) {
                    indxInSorted--;
                }
                if(indxInSorted>=0){
                    //System.err.println(currentin+" "+arr[indxInSorted].value);
                    if(currentin<arr[indxInSorted].value)
                        maxDiff=Math.max(maxDiff,arr[indxInSorted].value-currentin);
                }
            }
            if(maxDiff==0)
                out.println(0);
            else {
                int i=1;
                int maxPower=1;
                while(maxDiff>0){
                    if(maxDiff%2==1)
                        maxPower=i;
                    i++;
                    maxDiff/=2;
                }
                out.println(maxPower);
            }

        }

        out.flush();
        out.close();

    }
}
