Given ~N~ leaves and each person can rake at most ~M~ leaves each, find the minimum number of people needed to rake all the leaves.

Input Specification

The first line of input will contain an integer ~N (1 \le N \le 10^9)~, the total number of leaves.

The second line of input will contain an integer ~M (1 \le M \le 10^3)~, the number of leaves each person can rake.

Output Specification

Output one integer, representing the minimum number of people needed to rake all the leaves.

Sample Input

20
6

Sample Output

4

Sample Explanation

~3~ people would not be enough because they can only rake ~18~ leaves, so you need ~4~ people to rake all ~20~ leaves.