Joey is at Central Perk Cafe drinking coffee. He has decided to order n litres of coffee.

Central Perk offers coffee in mugs. Each mug can hold k litres of coffee.

Find the minimum number of coffee mugs needed by Central Perk to fill n litres of coffee.

See the sample case for better understanding.

Input format:

One line containing two integers n and k.

Output format:

Print the minimum number of mugs needed by Central Perk.

Constraints:

0 <= n <= 1000000000 (10^9)

1 <= k <= 1000000000 (10^9)