You have unlimited number of coins with values $1, 2, \ldots, n$. You want to select some set of coins having the total value of $S$. 

It is allowed to have multiple coins with the same value in the set. What is the minimum number of coins required to get sum $S$?


-----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$.


-----Examples-----
Input
5 11

Output
3
Input
6 16

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.

Difficulty: interview

Starter code:

Solutions:
n, m =list(map(int, input().split()))
if m % n != 0:
	print( m // n + 1)
else:
	print(m // n)


#n, m = map(int, input().split())
#x = int(input())
n, m = map(int, input().split())
ans = m // n + min(1, m % n)
print(ans)

n, s = map(int, input().split())
print((s + n - 1) // n)

m, a = map(int, input().split())
if (a % m == 0):
    print(a // m)
else:
    print(a//m + 1)

n, s = list(map(int, input().split()))
if s % n == 0:
    print(s // n)
else:
    print(s // n + 1)


from sys import stdin, stdout
from math import sin, tan, cos, pi, atan2, sqrt, acos, atan, factorial

n, s = map(int, stdin.readline().split())
stdout.write(str((s + n - 1) // n))

n, S = list(map(int, input().split()))
print(((S + n - 1) // n));


n, s = list(map(int, input().split()))
ans = s // n
s %= n
if s != 0:
    ans += 1
print(ans)


n,s=map(int,input().split())
x=s//n
if x*n<s:
    x+=1
print(x)

import math

(n, k) = input().split()
n, k = int(n), int(k)
print (int(math.ceil(k / n)))

n, s = list(map(int, input().split()))
num_1 = s // n
if s % n == 0:
    print(num_1)
else:
    print(num_1 + 1)

n,s=list(map(int,input().split()))
count=0
for i in range(n):
    count+=(s//(n-i))
    s-=(s//(n-i))*(n-i)
print(count)


import math as ma
import sys
from decimal import Decimal as dec
from itertools import permutations


def li():
	return list(map(int , input().split()))


def num():
	return map(int , input().split())


def nu():
	return int(input())


n,s=num()
cc=0
for i in range(n,0,-1):
	cc+=s//i
	s=s%i
print(cc)

n, s = map(int, input().split())

print((s + n - 1) // n)

n, s = list(map(int, input().split()))

big = s // n
r = s - big * n
if r > 0:
    print(big + 1)
else:
    print(big)


#a = [int(i) for i in input().split()]
#n = input()
n,s = map(int,input().split())

if s%n==0:
	print(s//n)
else:
	print(s//n+1)

import math
n, s=map(int, input().split())
print (math.ceil(s/n))

n, s = map(int, input().split())
res = 0
for i in range(n, 0, -1):
    res += s//i
    s = s % i
print(res)

n, s = map(int, input().split())
cnt = 0
for i in range(n, 0, -1):
    cnt += s // i
    s %= i
print(cnt)

n, s = list(map(int, input().split(' ')))

if(s <= n):
  sol = 1
else:
  sol = s // n
  if(s % n):
    sol += 1

print(sol)



from math import *
k,n=map(int,input().split())
print(ceil(n/k))

n, s = list(map(int, input().split()))
print((s + n - 1) // n)


import sys
from math import ceil
input_file = sys.stdin

[n, s] = list(int(x) for x in input_file.readline().split())
print(ceil(s/n))


n, S = map(int, input().split())
print(S // n + int(S % n != 0))

n,k =[*map(int, input().split())]

ans = int(k/n)
if k %n != 0:
    ans+=1
print(ans)