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.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.*;

public class PoweredAddition {
    private int[] number;

    public static void main(String[] args) throws Exception {
//        System.setIn(new FileInputStream("input.txt"));
        new PoweredAddition().run();
    }

    void run() throws Exception {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        int testCases = Integer.parseInt(reader.readLine());
        for (int i = 0; i < testCases; i++) {
            int n = Integer.parseInt(reader.readLine());
            StringTokenizer tokenizer = new StringTokenizer(reader.readLine());
            int[] array = new int[n];
            for (int j = 0; j < n; j++) {
                array[j] = Integer.parseInt(tokenizer.nextToken());
            }
            this.setArray(array);
            System.out.println(this.getSecond());
        }
    }

    public void setArray(int[] number) {
        this.number = number;
    }

    public int getSecond() {
        return getSolution2();
    }

    private int getSolution2() {
        int time = 0;
        int index = 0;
        while (index < number.length) { // 5, -2
            if (index + 1 < number.length && number[index] > number[index + 1]) { // found non-decreasing
                time = Math.max(time, getTime(number, index));
            }
            index++;
        }
        return time;
    }

    private int getTime(int[] number, int index) {
        int startPosition = index + 1;
        int lastPosition = getLastPosition(number, index);
        int max = 0;
        for (int i = startPosition; i<= lastPosition; i++) {
            int diff = number[index] - number[i];
            max = Math.max(max, diff);
        }
        int mostLeftBitPosition = getMostLeftBitPosition(max);
//        System.out.println("max: " + max + ", leftMost: " + mostLeftBitPosition);
        return mostLeftBitPosition;
    }

    private int getMostLeftBitPosition(int max) {// 110 = 3
        int bit = 0;
        while(max > 0) {
            bit++;
            int valueAtBit = getIncrementByGivenTime(bit); // max - 1, 2, 4
            if ((max & valueAtBit) > 0) {
                max -= valueAtBit;
            }
        }
        return bit;
    }

    private int getLastPosition(int[] number, int index) {
        for (int i = index + 1; i < number.length; i++) {
            if (number[index] <= number[i]) {
                return i;
            }
        }
        return number.length - 1;
    }

    private int getSolution1() {
        int time = 0;
        int indexPointer = 0;
        System.out.println(time + ": " + Arrays.toString(number));
        while (indexPointer < number.length) {
            // TODO: check if has some number afterwards less than current
            while (hasElementAfterwardLessThanCurrentElementPosition(indexPointer)) { // has some number afterwards less than
                time++;
                List<Integer> arrayOfIndices = getArrayOfIndices(indexPointer);
                incrementIndexInArrayByTime(time, arrayOfIndices);
                System.out.println(time + ": " + Arrays.toString(this.number));
            }
            indexPointer++;
        }
        return time;
    }

    private boolean hasElementAfterwardLessThanCurrentElementPosition(int indexPointer) {
        for (int i = indexPointer + 1; i < number.length && i < indexPointer + 2; i++) {
            if (number[indexPointer] > number[i]) return true;
        }
        return false;
    }

    private List<Integer> getArrayOfIndices(int indexPointer) {
        List<Integer> arrayOfIndices = new ArrayList<Integer>();
        for (int j = indexPointer + 1; j < number.length; j++) {
            if (number[indexPointer] > number[j]) {
                arrayOfIndices.add(j);
            }
        }
        return arrayOfIndices;
    }

    private void incrementIndexInArrayByTime(int time, List<Integer> arrayOfIndices) {
        for (int index : arrayOfIndices) {
            number[index] = number[index] + getIncrementByGivenTime(time);
        }
    }

    public int getIncrementByGivenTime(int time) {
        return (int) Math.pow(2, time - 1);
    }
}
