Coins

Description:

Input:

The only line of the input contains two integers $$$n$$$ and $$$S$$$ ($$$1 \le n \le 100\,000$$$, $$$1 \le S \le 10^9$$$)

Output:

Print exactly one integer — the minimum number of coins required to obtain sum $$$S$$$.

Sample Input:

5 11

Sample Output:

3

Sample Input:

6 16

Sample Output:

3

Note:

In the first example, some of the possible ways to get sum $$$11$$$ with $$$3$$$ coins are:

• $$$(3, 4, 4)$$$
• $$$(2, 4, 5)$$$
• $$$(1, 5, 5)$$$
• $$$(3, 3, 5)$$$

It is impossible to get sum $$$11$$$ with less than $$$3$$$ coins.

In the second example, some of the possible ways to get sum $$$16$$$ with $$$3$$$ coins are:

• $$$(5, 5, 6)$$$
• $$$(4, 6, 6)$$$

It is impossible to get sum $$$16$$$ with less than $$$3$$$ coins.