A - Playing with Paper

A - Playing with Paper

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.

Example

Input

2 1

Output

2

Input

10 7

Output

6

Input

1000000000000 1

Output

1000000000000

Note

Pictures to the first and second sample test.

题意：给定一个矩形，每次剪掉一个最大的正方形，直到最后所有都为正方形，求最后的正方形个数。

题解：用辗转相除发，将每次计算的那个乘数相加即为最后的结果，注意数据类型要用long long。

#include <stdio.h>

__int64 count = 0;

int gcd(__int64 a,__int64 b)
{
    if(b)
    count = count + a / b;
    return b == 0 ? a : gcd(b,a % b);
}


int main()
{
    __int64 a,b;
    scanf("%I64d%I64d",&a,&b);
    gcd(a,b);
    printf("%I64d",count);

    return 0;
}