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 C (GCC 5.4.1) (judge verdict: Accepted)



#pragma warning(disable:4996)
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#define MAX_STRING 100

	char sInput[MAX_STRING+1]="";


int main() {
	char* psInput;

	int i=0;
	int j=0;
	long long nMin=0;
	long long  nMax=0;
	long long  nNow=0;
	long long  nCount=0;

	// read line 1
	gets(sInput);
	psInput = strtok(sInput," ");
	nMin = atoll(psInput);
	psInput = strtok(NULL," ");
	nMax = atoll(psInput);

	nNow=nMin;

	while(nNow<=nMax){
		nCount++;
		nNow=nNow*2;
	}

	printf("%lld\n",nCount);
	

    return 0;
}