Husband and his wife can drink a barrel of kvass for N days. The wife can drink this barrel for W days. It is required to find out how many days the husband should spend to drink it.
The first line of input contains two integers: N and W (1 ≤ N ≤ 1000, 1 ≤ W≤ 1000). It is guaranteed that the problem is always solvable in positive integers, not exceeding 1000.
Output a single positive integer: solution for task.
Sample Input | Sample Output |
---|---|
10 35 | 14 |
15 240 | 16 |