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].
#include <bits/stdc++.h>
const int MAXN = 1e5 + 10;
const int INF = 1e18 + 10;
using namespace std;
int T, N, M;
long long A[MAXN], pot[35];
bool test(int x) {
  long long new_A[MAXN];
  new_A[N + 1] = INF;
  for (int i = N; i > 0; i--) {
    new_A[i] = A[i];
    for (int j = x - 1; j >= 0; j--)
      if (new_A[i] + pot[j] <= new_A[i + 1]) new_A[i] += pot[j];
    if (new_A[i] > new_A[i + 1]) return false;
  }
  return true;
}
int main() {
  pot[0] = 1LL;
  for (int i = 1; i < 31; i++) pot[i] = pot[i - 1] << 1;
  scanf("%d", &T);
  while (T--) {
    scanf("%d", &N);
    for (int i = 1; i < N + 1; i++) scanf("%lld", &A[i]);
    bool ok = true;
    for (int i = 1; i < N; i++)
      if (A[i] > A[i + 1]) {
        ok = false;
        break;
      }
    if (ok) {
      printf("0\n");
      continue;
    }
    int l = 1, r = 31, mid, best;
    while (l <= r) {
      mid = (l + r) >> 1;
      if (test(mid)) {
        best = mid;
        r = mid - 1;
      } else
        l = mid + 1;
    }
    printf("%d\n", best);
  }
}
