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;
int main() {
  long long t = 1;
  cin >> t;
  double dp[32] = {1,
                   2,
                   4,
                   8,
                   16,
                   32,
                   64,
                   128,
                   256,
                   512,
                   1024,
                   2048,
                   4096,
                   8192,
                   16384,
                   32768,
                   65536,
                   131072,
                   262144,
                   524288,
                   1048576,
                   2097152,
                   4194304,
                   8388608,
                   16777216,
                   33554432,
                   67108864,
                   134217728,
                   268435456,
                   536870912,
                   1.07374182e9,
                   2.14748365e9};
  while (t--) {
    long long n;
    cin >> n;
    vector<long long> v(n);
    for (long long i = 0; i < n; i++) cin >> v[i];
    long long ans = INT_MIN, top = v[0];
    cout << fixed << setprecision(10);
    for (long long i = 1; i < n; i++) {
      if (v[i] >= top)
        top = v[i];
      else {
        long long dif = top - v[i];
        long long x = lower_bound(dp, dp + 32, dif) - dp;
        if (v[i] + dp[x] != top) x--;
        ans = max(ans, x);
      }
    }
    if (ans == INT_MIN)
      cout << 0 << endl;
    else
      cout << ans + 1 << endl;
    ;
  }
  return 0;
}
