Incomplete Book

Time limit1sMemory limit512 MB

Summary

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

Level: Easy2 of 10
Topics: Math, Simulation, Implementation
Solved: No attempts yet

Problem

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

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

Input

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

Output

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

Examples4

Example 1
Input
```
1 1
```
Expected output
```
1
```
Example 2
Input
```
1 2
```
Expected output
```
1
```
Example 3
Input
```
1 3
```
Expected output
```
2
```
Example 4
Input
```
117 1337
```
Expected output
```
3
```