codeforces 527A Playing with Paper

A. Playing with Paper

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ≤ 1012) — the sizes of the original sheet of paper.

Output

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

Examples

input

Copy

2 1

output

2

input

Copy

10 7

output

6

input

Copy

1000000000000 1

output

1000000000000

Note

Pictures to the first and second sample test.

题意就是给你一个n*m的长方形，每次不断的将宽翻折成为正方形并将其剪下去，每个正方形可以折叠成为一个小船，问你最后可以得到几只小船，其实就是模拟，每次计算长除以宽，保留余数，再让宽为余数，长为原来的宽，不断更新累加即可得到答案

（要注意数据范围，long long）

#include<iostream>
using namespace std;
int main()
{
	long long a,b;
	cin>>a>>b;
	long long s=0;
	while(b)
	{
		long long e=a/b;
		long long d=a%b;
		a=b;
		b=d;
		s+=e;
	}
	cout<<s<<endl;
	return 0;
}