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>
using namespace std;
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int minthis(int a, int b) {
  if (a < b) {
    return a;
  }
  return b;
}
int maxthis(int a, int b) {
  if (a > b) {
    return a;
  }
  return b;
}
int gcd(int a, int b) {
  if (a < 0) a = -a;
  if (b < 0) b = -b;
  while (b != 0) {
    a %= b;
    if (a == 0) return b;
    b %= a;
  }
  return a;
}
int findLargestDivisor(int n) {
  int max = 1;
  for (int i = 2; i < n; i++) {
    if (n % (i) == 0) {
      max = i;
    }
  }
  return max;
}
bool check(int n) {
  for (int i = 2; i < 32; i++) {
    if (n == 1 << i) {
      return true;
    }
  }
  return false;
}
void solve() {
  int n;
  cin >> n;
  int cnts[32] = {0};
  int max = INT_MIN;
  int mini;
  int min = INT_MAX;
  int maxi;
  int ans;
  int arr[n];
  int maxdiff = INT_MIN;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    max = maxthis(max, arr[i]);
    if (i != 0 && arr[i] - max < 0) {
      maxdiff = maxthis(maxdiff, abs(max - arr[i]));
    }
  }
  if (maxdiff > 0) {
    for (int i = 0; i < 32; i++) {
      auto j = maxdiff & (1 << i);
      if (j) {
        cnts[i]++;
        ans = i + 1;
      }
    }
    cout << ans << "\n";
  } else {
    cout << 0 << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
