Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

Maximum Length

Compute the maximum length of an integer sequence A which satisfies the following conditions.

It consists of integers between X and Y (inclusive).


For each i (2 ≤ i ≤ Len), Ai+1 > Ai and Ai+1 % Ai = 0.

Input Format
The first line contains two space-separated integers X and Y .

Output Format
Print a single integer, maximum possible length of the sequence.

Time Limit
1 second

Constraints

1 ≤ X, Y ≤ 1018

Example
Sample Input 1

3 20

Sample Output 1

Sample test case explanation


Test 1:

One possible sequence is [3, 6, 18].

Max possible length = 3.

You might also like