每日一题F

Description

One day Vasya was sitting on a not so interesting Maths lesson and making an origami from a rectangular a mm  × b mm sheet of paper (a > b). Usually the first step in making an origami is making a square piece of paper from the rectangular sheet by folding the sheet along the bisector of the right angle, and cutting the excess part.

After making a paper ship from the square piece, Vasya looked on the remaining (a - b) mm  × b mm strip of paper. He got the idea to use this strip of paper in the same way to make an origami, and then use the remainder (if it exists) and so on. At the moment when he is left with a square piece of paper, he will make the last ship from it and stop.

Can you determine how many ships Vasya will make during the lesson?

Input

The first line of the input contains two integers a, b (1 ≤ b < a ≤ 10¹²) — the sizes of the original sheet of paper.

Output

Print a single integer — the number of ships that Vasya will make.

Sample Input

Input

2 1

Output

2

Input

10 7

Output

6

Input

1000000000000 1

Output

1000000000000

Hint

Pictures to the first and second sample test.

<pre name="code" class="objc">#include <stdio.h>


int main()
{
    long long a,b,t,count=0;
    scanf("%I64d %I64d",&a,&b);
    while(b!=0)
    {
        count+=a/b;
        t=b;
        b=a%b;
        a=t;
    }
    printf("%I64d",count);
    return 0;
}

做这个题看似很简单，如果你一点一点加减最后给你一个大数据肯定会超时，这个题用到了辗转相除法，a/b只要b不是0，那么就用大的除以小的，商如和b比较大的做a，小的左b;仔
细看看图就懂了。