Incomplete Book

Given the first book takes k days and each later book takes twice the previous, count how many books finish by day d.

Easy2MathSimulationImplementationNo attempts yetTime limit1sMemory limit512 MB

Problem

An author is writing a series of novels. The first book took kk days, and the writing got slower with every book after that. To be precise, if the ii-th book took \ell days, the (i+1)(i+1)-th book takes 22\ell days.

The author dies dd days after starting the first book. A book counts as finished if the day it is completed is not later than day dd. What is the largest number of books the author can finish?

Input

One line holds two integers kk and dd separated by a space. kk is the number of days the first book takes (1k3651 \le k \le 365), and dd is the number of days between the start of the first book and the author's death (kd109k \le d \le 10^9).

Output

Print the largest number of books the author can finish, on one line.