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)

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>

/*
駅iからi+1にいく時
今までかかった時間val
val-s[i]%f[i] ==0
val = val+c[i] 
(val-s[i])%f[i] !=0
val = s[i] + ((val-s[i])/f[i] + 1)*f[i] + c[i];



*/


int main(void){
    long long x,y;
    scanf("%lld %lld",&x,&y);
    long long val = x,counter = 0;
    while(val<=y){
        val = val*2;
        counter++;
    }
    printf("%lld\n",counter);
    return 0;
}