Teemu wants to put n mugs on shelves. One shelf can hold at most k mugs. How many shelves does Teemu need?

Input

The input contains two space separated integers n and k.

Output

Print the minimum number of shelves needed.

Constraints

• 0 \leq n \leq 10^{18}
• 1 \leq k \leq 10^{18}

Example

Input:

5 3

Output:

2