CodeForces334B

Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.

However, all Mike has is lots of identical resistors with unit resistance R0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:

one resistor;
an element and one resistor plugged in sequence;
an element and one resistor plugged in parallel.

With the consecutive connection the resistance of the new element equals R = Re + R0. With the parallel connection the resistance of the new element equals . In this case Re equals the resistance of the element being connected.

Mike needs to assemble an element with a resistance equal to the fraction . Determine the smallest possible number of resistors he needs to make such an element.

Input
The single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 1018). It is guaranteed that the fraction is irreducible. It is guaranteed that a solution always exists.

Output
Print a single number — the answer to the problem.

Please do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.

Example
Input
1 1
Output
1
Input
3 2
Output
3
Input
199 200
Output
200
Note
In the first sample, one resistor is enough.

In the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance . We cannot make this element using two resistors

import org.omg.PortableInterceptor.SYSTEM_EXCEPTION;import java.util.Scanner;/** * Created by 95112 on 10/22/2017. */public class Resistor {    static long a,b;    public static void main(String[] args)    {        Scanner scanner = new Scanner(System.in);        a = scanner.nextLong();        b = scanner.nextLong();        change();        long tmp = 0;        while (a > 0){            if (b==0)                break;            tmp += a/b;            a = a % b;            change();        }        System.out.println(tmp);    }    private static void change(){        if (a > b)            return;        else{            b = a + b;            a = b - a;            b = b - a;        }    }}