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# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using static System.Console;
using static System.Math;

namespace CP
{
    class Atria
    {
        static void Main(string[] args)
        {
            long[] xy = ReadLine().Split(' ').Select(long.Parse).ToArray();
            if (xy[0] == 1)
            {
                WriteLine(xy[1]);
            }
            else
            {
                var left = 0L;
                var right = xy[1];
                while (left < right)
                {
                    var mid = (left + right) / 2;
                    if (xy[1] - (xy[0]*Pow(2, mid)) >= 0)
                    {
                        left = mid + 1;
                    }
                    else right = mid;
                }
                WriteLine(right);
            }
        }
    }
}