AtCoder Beginner Contest 083
C
Multiple Gift
AtCoder
⌀ 392
原题
← BD →
翻译中…

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.

翻译中…

样例

Input #1
3 20
Output #1
3
The sequence $3,6,18$ satisfies the conditions.
Input #2
25 100
Output #2
3
Input #3
314159265 358979323846264338
Output #3
31
题目信息
题号
arc088_a
时间限制
2 s
内存限制
256 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。