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>
#pragma GCC target("avx2")
#pragma comment(linker, "/STACK:10000000000")
using namespace std;
const long long N = 1e6, MOD = 1e9 + 7, INF = 1e9, miniINF = 1e5, M = 2e5;
const long long bigINF = 1e18;
const long double EPS = 1e-9, pi = 3.141592653589793238462, rad = 57.2957795;
long long n, t;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  while (t--) {
    cin >> n;
    long long rs = -1;
    vector<long long> t;
    t.resize(n);
    for (int i = 0; i < n; ++i) {
      cin >> t[i];
    }
    for (int i = 1; i < n; ++i) {
      if (t[i] >= t[i - 1]) continue;
      long long deg = -1;
      while (t[i] < t[i - 1]) {
        ++deg;
        t[i] += (1LL << deg);
      }
      t[i] = t[i - 1];
      rs = max(rs, deg);
    }
    cout << rs + 1 << '\n';
  }
}
