Polycarp calls an array dense if the greater of any two adjacent elements is not more than twice bigger than the smaller. More formally, for any i (1 ≤ i ≤ n-1), this condition must be satisfied: $$$(max(a[i], a[i+1]))/(min(a[i], a[i+1])) ≤ 2$$$

For example, the arrays [1, 2, 3, 4, 3], [1, 1, 1] and [5, 10] are dense. And the arrays [5, 11], [1, 4, 2], [6, 6, 1] are not dense.

You are given an array a of n integers. What is the minimum number of numbers you need to add to an array to make it dense? You can insert numbers anywhere in the array. If the array is already dense, no numbers need to be added.

For example, if a=[4,2,10,1], then the answer is 5, and the array itself after inserting elements into it may look like this: a=[4,2,\underline{3},\underline{5},10,\underline{6},\underline{4},\underline{2},1] (there are other ways to build such a).

Input

The first line contains one integer t (1 ≤ t ≤ 1000). Then t test cases follow.

The first line of each test case contains one integer n (2 ≤ n ≤ 50) — the length of the array a.

The next line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 50).

Output

For each test case, output one integer — the minimum number of numbers that must be added to the array to make it dense.

Example

Input


6
4
4 2 10 1
2
1 3
2
6 1
3
1 4 2
5
1 2 3 4 3
12
4 31 25 50 30 20 34 46 42 16 15 16


Output


5
1
2
1
0
3

Note

The first test case is explained in the statements.

In the second test case, you can insert one element, a=[1,\underline{2},3].

In the third test case, you can insert two elements, a=[6,\underline{4},\underline{2},1].

In the fourth test case, you can insert one element, a=[1,\underline{2},4,2].

In the fifth test case, the array a is already dense.
import java.io.*;
import java.util.*;

public class dung {
	static InputStream inputStream = System.in;
	static OutputStream outputStream = System.out;
	static InputReader in = new InputReader(inputStream);
	static PrintWriter out = new PrintWriter(outputStream);

	public static void main(String[] args) throws IOException {

		// code from here
		int t = in.nextInt();
		while (t-- > 0) {
			solve();
		}
//		solve();
		out.close();

	}

	private static void solve() {
		int n = in.nextInt();
		int res = 0;
		int prev = in.nextInt();
		for (int i = 0; i < n - 1; i++) {
			int curr = in.nextInt();
			int min = Math.min(prev, curr);
			int max = Math.max(prev, curr);
			if (max <= min * 2) {
				prev=curr;
				continue;
			}else {
				while(max>2*min) {
					min*=2;
					res++;
				}
				prev=curr;
			}
			

		}
		out.println(res);
	}

	private static int check(int[] arr, int l, int r, int k) {
		int res = 0;
		for (int i = l; i <= r; i++) {
			int curr = arr[i];
			int prev = 1;
			int next = k;
//			1 2 4 5
//			  / /
			if (i > 0) {
				prev = arr[i - 1];
			}
			if (i < arr.length - 1) {
				next = arr[i + 1];
			}
			res += curr - prev;
			res += next - curr;

		}
		return res;
	}

	private static boolean[] sieveOfEratosthenes(int n) {
		boolean prime[] = new boolean[n + 1];
		for (int i = 0; i <= n; i++)
			prime[i] = true;
		prime[0] = false;
		prime[1] = false;

		for (int p = 2; p * p <= n; p++) {
			if (prime[p] == true) {
				for (int i = p * p; i <= n; i += p)
					prime[i] = false;
			}
		}
//		int[] arr = new int[n];
//		int j = 0;
//		for (int i = 2; i <= n; i++) {
//			if (prime[i] == true)
//				arr[j++] = i;
//		}
		return prime;
	}

	private static int lcm(int n1, int n2) {
		return (n1 * n2) / gcd(n1, n2);
	}

	private static int gcd(int num1, int num2) {
		if (num2 == 0) {
			return num1;
		}
		return gcd(num2, num1 % num2);
	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

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

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

		public String nextLine() throws IOException {
			return reader.readLine().trim();
		}
	}
}