You have an infinite number of coins in denominations from 1 to n. You want to select some set of coins with the sum s. It is allowed to have coins with the same denomination in the set. What is the minimum number of coins you need to take to get the amount of s.

Input

Two integers n and s (1 ≤ n ≤ 105, 1 ≤ s ≤ 109).

Output

Print the minimum number of coins required to take the amount s.