A frog is trying to return to its burrow. The burrow is D cm in front of the frog, and the frog is going straight for the burrow. There are only two actions the frog can take.
The frog does not jump over the burrow, but just aims to land on the burrow.
Write a program to find the minimum number of jumps the frog needs to make to return to its burrow.
Input is given in the following format.
D L
The distance to the burrow D (1 ≤ D ≤ 10000) and the distance the flog can move by large jump L (2 ≤ L ≤ 10000) are given in a line.
Output how many times the frog needs to jump at least on a single line.
10 5
2
7 4
4