Time Limit : sec, Memory Limit : KB
English / Japanese  

Frog Going Straight

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.

  • Large jump (move forward L cm)
  • Small jump (move forward 1cm)

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

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

Output how many times the frog needs to jump at least on a single line.

Sample Input 1

10 5

Sample Output 1

2

Sample Input 2

7 4

Sample Output 2

4