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.Linq;
using System.Collections.Generic;
class P
{
    static void Main()
    {
        string s = Console.ReadLine();
        List<int>[] alphabet = new List<int>[26];

        List<char> slist = s.ToList();
        int res = 0;
        int length = s.Length / 2;
        bool allowSingle = (s.Length % 2) == 1;
        for (int i = 0; i < length; i++)
        {
            //見渡せばピカピカの 明日がきっと待ってる
            //明日を登って せーので飛び出した
            char c = slist[0];
            int index = slist.FindLastIndex(x => x == c);
            if (index != 0)
            {
                res += slist.Count - (index + 1);
                slist.RemoveAt(index);
                slist.RemoveAt(0);
            }
            else if (allowSingle)
            {
                res += slist.Count / 2;
                slist.RemoveAt(0);
                allowSingle = false;
            }
            else
            {
                res = -1;
                break;
            }
        }
        Console.WriteLine(res);
    }
}