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 Common Lisp (SBCL 1.1.14) (judge verdict: Wrong Answer)

;; -*- coding:utf-8 -*-

(eval-when (:compile-toplevel :load-toplevel :execute)
  (defparameter OPT
    #+swank '(optimize (speed 3) (safety 1))
    #-swank '(optimize (speed 3) (safety 0) (debug 0))))

(defmacro println (obj &optional (stream '*standard-output*))
  `(prog1 (princ ,obj ,stream) (terpri ,stream)))

;; Hauptteil

(deftype uint nil `(integer 0 ,(expt 10 9)))

(defun push-carton (carton rest candidate-rest)
  (if (null rest)
      (if candidate-rest
          (push carton (car candidate-rest))
          (push (list carton) *haystacks*))
      (let ((stack (car rest)))
        (if (and (<= carton (car stack))
                 (or (null candidate-rest)
                     (<= (car stack) (caar candidate-rest))))
            (push-carton carton (cdr rest) rest)
            (push-carton carton (cdr rest) candidate-rest)))))

(defun main ()
  (let ((n (read))
        (*haystacks* nil))
    (declare (special *haystacks*))
    (dotimes (i n)
      (push-carton (read) *haystacks* nil))
    (println (length *haystacks*))))

#-swank(main)