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.Scanner;
import java.util.Stack;
import java.util.TreeMap;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.PriorityQueue;

public class pac1 {
	static Scanner scn = new Scanner(System.in);
	// static int count = 0;
	

	public static void main(String[] args) throws Exception {

		
		int t=scn.nextInt();
		while(t-->0)
		{
			int n=scn.nextInt(),count=0;
			
		Integer arr[]=new Integer[n];
		for(int i=0;i<n;i++)
			arr[i]=scn.nextInt();
		
		int ans=Integer.MIN_VALUE,max=Integer.MIN_VALUE;
		for(int i=0;i<n;i++)
		{
			max=Math.max(max, arr[i]);
			ans=Math.max(ans,max-arr[i]);
		}
		if(ans==0)
			System.out.println("0");
		else
		{
			System.out.println(log(ans, 2)+1);
		}
		
		}
		
		
	}
	public static int log(int x, int b)
	{
	    return (int) (Math.log(x) / Math.log(b));
	}
	
	public static int palin(String str)
{
		int n=str.length(),count=0;
		
		for(int i=0;i<n/2;i++)
		{
			if(str.charAt(i)!=str.charAt(n-i-1))
			{
				count++;
			}
		}
		return count;
	}
	public static long gcd(long a, long n) {

		if (a == 0)
			return n;
		return gcd(n % a, a);
	}
}
	class pair{
		int x;
		int y;
		public pair(int a,int b)
		{
			this.x=a;
			this.y=b;
		}
	}
	class sorting implements Comparator<pair>
	{

		@Override
		public int compare(pair o1, pair o2) {
			// TODO Auto-generated method stub
			int a=Math.max(o1.x, o2.x),b=o1.y-o2.y;
			if(b==0) return a;
			else
				return b;
		}
		
	}


//	class Point {
//	int x;
//	int y;
//
//	Point(int a, int b) {
//		x = a;
//		y = b;
//	}
//	}
//
//	class sortingPoint implements Comparator<Point> {
//		public int compare(Point p1, Point p2) {
//		if (p1.x == p2.x)
//			return p1.y - p2.y;
//		else
//			return p1.x - p2.x;
//	}
//}