codeforces C. Memory and De-Evolution

C. Memory and De-Evolution

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Memory is now interested in the de-evolution of objects, specifically triangles. He starts with an equilateral triangle of side length x, and he wishes to perform operations to obtain an equilateral triangle of side length y.

In a single second, he can modify the length of a single side of the current triangle such that it remains a non-degenerate triangle (triangle of positive area). At any moment of time, the length of each side should be integer.

What is the minimum number of seconds required for Memory to obtain the equilateral triangle of side length y?

Input

The first and only line contains two integers x and y (3 ≤ y < x ≤ 100 000) — the starting and ending equilateral triangle side lengths respectively.

Output

Print a single integer — the minimum number of seconds required for Memory to obtain the equilateral triangle of side length y if he starts with the equilateral triangle of side length x.

Examples

input

6 3

output

4

input

8 5

output

3

input

22 4

output

6

Note

In the first sample test, Memory starts with an equilateral triangle of side length 6 and wants one of side length 3. Denote a triangle with sides a, b, and c as (a, b, c). Then, Memory can do .

In the second sample test, Memory can do .

In the third sample test, Memory can do: 

.

题意：问你最少需要多少步将把边长为x的等边三角形变成边长为y的等边三角形，要求你每次变换只能变一条边，并且变换后的三条边也能组成三角形

思路：从边长为y的等边三角形倒推成边长为x的等边三角形即可

#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
    int x,y;
    int a[4];
    while(~scanf("%d%d",&x,&y))
    {
        int temp = 0;
        a[0] = y,a[1] = y,a[2] = y;
        while(a[0] < x)
        {
            temp++;
            a[0] = a[1] + a[2] - 1;
            sort(a,a+3);
        }
        printf("%d\n",temp);
    }
    return 0;
}