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++ (Clang 3.8.0) (judge verdict: Runtime Error)

#include <iostream>
#include <string>
#include <vector>
using namespace std;

string mul_by_2(string s) {
    char c[30];
    int j = 0;
    int tmp;
    int carry = 0;
    int len = (int)s.length();
    for (int i = len - 1;i > -1;i--) {
        tmp = (s[i] - '0') * 2 + carry;
        c[j++] = tmp % 10+'0';
        carry = tmp / 10;
    }
    if (carry > 0) {
        c[j++] = carry + '0';
    }
    c[j] = '\0';
    string t(c);
    reverse(t.begin(), t.end());
    return t;
}
int main() {
    string x, y;
    cin >> x >> y;
    int cnt = 1;
    int y_len = (int)y.length();
    while (x.length()<y_len||x.compare(y)<0) {
        cnt++;
        x = mul_by_2(x);
    }
    cout << cnt << endl;
    return 0;
}