Problem:
Score : 300 points

Problem Statement

As a token of his gratitude, Takahashi has decided to give his mother an integer sequence.
The sequence A needs to satisfy the conditions below:

A consists of integers between X and Y (inclusive).

For each 1\leq i \leq |A|-1, A_{i+1} is a multiple of A_i and strictly greater than A_i.

Find the maximum possible length of the sequence.

Constraints

1 \leq X \leq Y \leq 10^{18}

All input values are integers.

Input

Input is given from Standard Input in the following format:

X Y

Output

Print the maximum possible length of the sequence.

Sample Input 1

3 20

Sample Output 1

3

The sequence 3,6,18 satisfies the conditions.

Sample Input 2

25 100

Sample Output 2

3

Sample Input 3

314159265 358979323846264338

Sample Output 3

31

Solution in JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

// inputに入力データ全体が入る
function Main(input) {
	var line = input.split("\n");
	var tmp = line[0].split(" ");
	var lower = Number(tmp[0]);
	var upper = Number(tmp[1]);

	if(upper > 1000000000){
		upper = upper + "";
		lower = "000000000000000" + lower + "";
		var lessenUpper = upper.slice(0,-8) + "." + upper.slice(-8);
		var lessenLower = lower.slice(0,-8) + "." + lower.slice(-8);
		upper = Number(lessenUpper);
		lower = Number(lessenLower);
	}
	// ans is x which satisfies lower * 2^(x-1) = upper
	var ans = Math.floor(Math.log2(upper/lower)) + 1;
	console.log(ans);
}

//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));