B'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? The first and only line contains two integers x and y (3 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89y xe2 x80 x89< xe2 x80 x89x xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100 xe2 x80 x89000) -- the starting and ending equilateral triangle side lengths respectively. 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. 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, xe2 x80 x89b, xe2 x80 x89c). Then, Memory can do . In the second sample test, Memory can do . In the third sample test, Memory can do: . '...