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.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;
public class C633 {

	public static void main(String[] args) {
		FastScanner in = new FastScanner(System.in);
		int T = in.nextInt();
		StringBuilder sb = new StringBuilder();
		while(T --> 0) {
			int N = in.nextInt();
			long[] arr = new long[N];
			for(int i = 0; i < N; i++) {
				arr[i] = in.nextLong();
			}
			
			long min = Integer.MAX_VALUE;
			for(int i = 0; i < N; i++) {
				min = Math.min(arr[i], min);
			}
			for(int i = 0; i < N; i++) {
				arr[i] -= min;
			}
			
			int low = 0;
			int high = 59;
			
			while(low <= high) {
				int mid = (low + high) / 2;
				
				boolean b = works(arr, mid);
				//System.out.println("mid = " + mid + " = " + b);
				if(b) {
					high = mid - 1;
				}
				else {
					low = mid + 1;
				}
			}
			
			// high
			int ans = Math.max(low, 0);
			sb.append(ans);
			sb.append("\n");
			
		}
		System.out.println(sb);

	}
	
	public static boolean works(long[] arr, int k) {
		/*
		long[] max = new long[arr.length];
		max[max.length-1] = arr[arr.length-1];
		for(int i = max.length-2; i >= 0; i--) {
			max[i] = Math.max(max[i+1], arr[i]);
		}
		*/
		
		int count = 0;
		int N = arr.length;
		
		long[] copy = new long[N];
		for(int i = 0; i < N; i++) {
			copy[i] = arr[i];
		}
		
		long most = (1L << k) - 1;
		copy[N-1] += most;
		
		for(int i = N-2; i >= 0; i--) {
			long diff = copy[i+1] - copy[i];
			
			if(0 <= diff && diff <= most) {
				copy[i] = copy[i+1];
			}
			else if(diff > most) {
				copy[i] += most;
			}
			
			count++;
		}
		
		for(int i = 0; i < N-1; i++) {
			if(copy[i] > copy[i+1]) {
				return false;
			}
		}
		
		return true;
	}
	
	/**
	 * Source: Matt Fontaine
	 */
	static class FastScanner {
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int chars;

		public FastScanner(InputStream stream) {
			this.stream = stream;
		}

		int read() {
			if (chars == -1)
				throw new InputMismatchException();
			if (curChar >= chars) {
				curChar = 0;
				try {
					chars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (chars <= 0)
					return -1;
			}
			return buf[curChar++];
		}

		boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		boolean isEndline(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}

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

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

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

		public String next() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		public String nextLine() {
			int c = read();
			while (isEndline(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndline(c));
			return res.toString();
		}
	}

}
/*
3
4
1 7 6 5
5
1 2 3 4 5
2
0 -4
outputCopy
2
0
3

1
1000 1 1000 999

*/