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

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

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

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

#include <iostream>

using namespace std;

int main()
{long int n,s;long int nb;
cin>>n>>s;

if(s%n==0)
    nb=s/n ;
    else
         nb=s/n +1;
cout<<nb<<endl;

    return 0;
}

#include<cstdio>

int main() {
	int n, s;
	scanf("%d %d", &n, &s);
	printf("%d", s / n + (s%n == 0 ? 0 : 1));
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define li long int
#define ll long long int
#define pb push_back
#define vi vector<li>
#define vv vector<ll>

ll minCoins(ll coins[], ll m, ll V)
{
    // table[i] will be storing the minimum number of coins
    // required for i value.  So table[V] will have result
    ll table[V+1];

    // Base case (If given value V is 0)
    table[0] = 0;

    // Initialize all table values as Infinite
    for (ll i=1; i<=V; i++)
        table[i] = INT_MAX;

    // Compute minimum coins required for all
    // values from 1 to V
    for (ll i=1; i<=V; i++)
    {
        // Go through all coins smaller than i
        for (ll j=0; j<m; j++)
          if (coins[j] <= i)
          {
              int sub_res = table[i-coins[j]];
              if (sub_res != INT_MAX && sub_res + 1 < table[i])
                  table[i] = sub_res + 1;
          }
    }
    return table[V];
}
ll a[100001];
int main()

{
   ll n,s;
   cin>>n>>s;

  if(s%n==0)
   cout<<s/n;
   else cout<<(s/n)+1;

   return 0;
}

#include <iostream>
#include<algorithm>
#include <vector>
using namespace std;

int a[10000022];
int main(int argc, const char * argv[]) {

	int n, s;
	cin >> n >> s;
	if (s % n == 0) {
		cout << s / n;
	}
	else {
		cout << s / n + 1;
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int ans=0;
	int n,s;
	cin>>n>>s;
	while(s>0)
	{
		s-=n;
		ans++;
	}
	cout<<ans<<endl;
	return 0;
}

#include <iostream>
using namespace std;

int coins(int maxCoinValue , int sum){
    int k=0;
    if (maxCoinValue >= sum)
        return 1;
    while (sum != 0){
        sum -= maxCoinValue;
        if(sum < maxCoinValue)
            maxCoinValue = sum;
        k++;
    }
    return k;
}

int main(){
    int n ;
    cin >> n;
    int s;
    cin >> s;
    int x;
    x = coins (n,s);
    cout << x;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{   long long n,m;
    cin>>n;
    cin>>m;

        int sum=ceil((double)m/(double)n);
    cout<<sum;

    return 0;
}

#include <iostream>

using namespace std;

int n, s;
int ans;

int main()
{
    cin >> n >> s;
    while (s != 0)
    {
        while (s >= n)
        {
            ans++;
            s -= n;
        }
        n--;
    }
    cout << ans;
    return 0;
}

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

int main()
{
    int n,sum;
    cin>>n>>sum;
    if(sum%n!=0)
    cout<<sum/n+1<<endl;
    else
    cout<<sum/n<<endl;

    return 0;
}

#include <iostream>

using namespace std;

int main(){
    int n, k;
    cin >> n >> k;
    for(int i = 1; i <= k; i++){
        if(n*i >= k){
            cout << i;
            return 0;
        }
    }
    return 0;
}

#include <iostream>
using namespace std;
int main()
{
	int n,s;
	cin>>n>>s;
	if(s%n==0)
	{
		cout<<s/n<<endl;
		return 0;
	}
	cout<<s/n+1<<endl;
	return 0;
}

#include <bits/stdc++.h>
typedef long double lg ;
typedef long long ll;
using namespace std;
const int N = 1e5 +5;

int main()
{
    i:
    lg n ,req;
    cin >> n >> req;
    cout << (ll)ceil(req/n)<<endl;
    return 0;
}

#include <cmath>
#include<bits/stdc++.h>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
int main () {
   int n,s,ans=0;
   cin>>n>>s;
   for(int i=n;i>0;i--){
   	ans+=s/i;
   	s%=i;
   }
   cout<<ans<<endl;
  return 0;
}

#include <iostream>
using namespace std;
int main()
{
    int a,b;
    cin>>a>>b;
    if((b%a)==0)
     cout<<(b/a);
    else
     cout<<(b/a+1);
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	double n, s;

	cin >> n >> s;

	cout << (int)(ceil(s/n)) << endl;

	return 0;
}

#include <bits/stdc++.h>
using namespace std;

int main ()
{
	ios_base::sync_with_stdio (0);
	int n, S; cin >> n >> S;
	if (S%n == 0) cout << S/n << endl; else
	cout << S/n+1 << endl;

	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,S,c=0,k;
    cin>>n>>S;
    cout<<(S%n==0?S/n:S/n+1);
}

#include <iostream>
#include <cmath>
using namespace std;
int n, S, ans;

int main()
{
    cin >> n >> S;
    ans = ceil(double(S)/n);
    cout << ans;
    return 0;
}

#include <iostream>

using namespace std ;

long long ans , d ;
int main()
{
	long long  n , m ;
	cin >> n >> m ;
	if( m % n == 0 )
	{
		cout << m / n ;
	}
	else if( m % n != 0 )
	{
		cout << m / n + 1 ;
	}
}

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
//fengxunling
using namespace std;
long long n,m;
int main()
{
	cin>>n>>m;
	long long ans=m/n;
	if(m%n!=0) ans++;
	cout<<ans<<endl;

	return 0;
}

# include <bits/stdc++.h>
using namespace std;

int n, a, cnt = 0;
vector <int> vc;
vector <int> b;

int main (){
    int n, m;
    cin >> n >> m;
    if (m % n == 0){
        while (m - n >= 0){
            m -= n;
            cnt ++;
        }
        cout << cnt;
    }
    else{
        while (m - n >= 0){
            m -= n;
            cnt ++;
        }
        cout << cnt + 1;
    }
}

/*
coded by : Bissultanov Yedyge;
:)
¤
•
¦
§
*/

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);

#define mp make_pair
#define np next_permutation

#define bg begin()
#define ed end()

#define int long long
#define ioi return 0;

#define sz size()
#define fix fixed<<setprecision

#define lb lower_bound
#define ub upper_bound

#define fr first
#define sc second

#define pb push_back
#define ppb pop_back

#define pf push_front
#define ppf pop_front

typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;

using namespace std;

int a[N];
int cnt;
int ans;
int n , m;

main(){
	ios
		cin >> n >> m;
		if ( m % n != 0 ){
			cout << ( m / n ) + 1;
		}
		else{
			cout << m / n;
		}
	ioi
}

#include<cstdio>

int main() {
	int n, s;
	scanf("%d %d", &n, &s);
	printf("%d", s / n + (s%n == 0 ? 0 : 1));
	return 0;
}

#include <iostream>
#include <conio.h>
using namespace std;
int main() {
	int N;
	long long S;
	long long acumulado = 0;
	cin >> N >> S;
	while (S >0 && N > 0) {
		if (N <= S) {
			acumulado += long long(S / N);
			S -= acumulado * N;
		}
		N = N - 1;
	}
	cout << acumulado;
	return 0;
}

#include <iostream>
using namespace std;

int main () {
	int S, n, a;
	cin >> n >> S;
	a=0;
	while (S>0) {
		while (S>=n) {
			S -= n;
			a++;
		}
		n--;
	}

	cout << a;

	//system("pause");

	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    double  n,s;
    cin>>n>>s;
    int a=(s+n-1)/n;
    cout<<a;
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int m, n, i, j, c;

int main()
{
    cin >> n >> m;
    if(m % n != 0){
        cout << (m / n) + 1;
    }
    if(m % n == 0){
        cout << m / n;
    }
}

/*
 * socode.online
 *
 * Author: Harper
 * E-mail: 22237762@qq.com
 * Time  : 2020-01-17 14:16:56
 */
#include <bits/stdc++.h>
using namespace std;

int main(){
	int n,s;
	scanf("%d%d",&n,&s);
	int a=n;
	if(s<=n)printf("%d",s);
	else {
	  for(int i=1;n!=s;i++){
	  	if(a+n>=s){
	  		a=i+1;
	  		break;
		}
		else a+=n;
	  }
	  printf("%d",a);
	}
	return 0;
}

// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define fo(i,n)             for(int i=0;i<n;i++)
#define nl                  "\n"
#define ff                  first
#define ss                  second
#define int                 long long
#define pb                  push_back
#define mp                  make_pair
#define vec(x)              vector<x>
#define matrix(x)           vector<vector<x>>
#define sz(x)               (int)x.size()
#define mem(a,b)            memset(a, b, sizeof a)
#define vii                 vector<pair<int,int>>
#define pii                 pair<int,int>
#define vi                  vector<int>
#define mii                 map<int,int>
#define uii                 unordered_map<int,int,custom_hash>
#define pqb                 priority_queue<int>
#define pqs                 priority_queue<int,vi,greater<int> >
#define gcd(a,b)            __gcd(a,b)
#define lcm(a,b)            (a*(b/gcd(a,b)))
#define setbits(x)          __builtin_popcountll(x)
#define zrobits(x)          __builtin_ctzll(x)
#define mod                 1000000007
#define MOD                 998244353
#define inf                 1e18
#define ps(x,y)             fixed<<setprecision(y)<<x
#define mk(arr,n,type)      type *arr=new type[n];
#define w(x)                int x; cin>>x; while(x--)
#define all(v)              v.begin(),v.end()
#define rep(i,begin,end)    for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define len(s)              s.length()

#define watch(x)            cout << #x << " = " << x << endl

#define deb(...) cerr << "[" << #__VA_ARGS__ << "] : [", DBG(__VA_ARGS__)
void DBG() { cerr << "]\n";}
template<typename T, typename ...Args> void DBG(T first, Args... args)
{cerr << first; if(sizeof...(args))cerr<<", "; DBG(args...); }

mt19937                     rng(chrono::steady_clock::now().time_since_epoch().count());

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; //for storing unique elements
typedef tree<int , null_type , less_equal<int> , rb_tree_tag , tree_order_statistics_node_update> ordered_set; //for repeating elements

int power(int a,int b,int m=mod)
{int ans=1;while(b>0){if(b&1)ans=(ans*a)%m;a=(a*a)%m;b>>=1;}
return ans;}

void babuBhaiya()
{
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int N = 1e5+1;
const double pi = acos(-1);

/*/-----------------------Modular Arithmetic---------------/*/
inline int add(int x,int y){
    x+=y;
    if (x>=mod) return x-mod;
    return x;
}
inline int sub(int x,int y){
    x-=y;
    if (x<0) return x+mod;
    return x;
}
inline int mul(int x,int y){
    return (x*1ll*y)%mod;
}
/*/-----------------------------Code begins----------------------------------/*/

void solve(){

    int n,s; cin>>n>>s;
    int ans = s/n;
    if(s%n != 0) ans++;
    cout<<ans;

}

int32_t main()
{
    babuBhaiya();

    int t;

    t = 1;
    //cin>>t;

    while(t--){
        solve();
    }

    return 0;
}

#include <iomanip>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <ctime>
#include <cstdio>
#include <cmath>
#include <queue>
#include <bitset>
#include <string>

#define ll long long
#define mp make_pair
#define pb push_back

using namespace std;

const int N = 300010;
const int MOD = 998244353;

int s, n;

int main() {
    cin >> n >> s;
    int ans = s / n + (s % n > 0 ? 1 : 0);
    cout << ans;
	return 0;
}

#include <bits/stdc++.h>
using namespace std;

#define itos(x) to_string(x)
#define stoi(x) stoi(x)
#define ctoi(x) (x-'0')
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
const ld pi = acos((ld)-1);
const ld e = exp(1);

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  int n, m; cin >> n >> m;
  if (m%n == 0) cout << m/n << "\n";
  else cout << m/n+1 << "\n";
}

#include <bits/stdc++.h>

using namespace std;
const int SIZE = 1005;

int dp[SIZE][SIZE];

int main() {
    double n, S;
    cin >> n >> S;

    if(S <= n) {
        cout << 1 << endl;
        return 0;
    }
    cout << (int)ceil(S/ n) << endl;

    return 0;
}

#include <iostream>

using namespace std;

int main() {

	int n, S;

	cin >> n >> S;

	if (S%n==0){

	     cout << S / n;
	} else {

	     cout << S / n + 1;
	}
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<stack>
#include<queue>
#include<string>
#include<set>
#include<list>
#include<cmath>
using namespace std;

int main()
{
	double n,k;
	cin>>n>>k;
	long ans=ceil(k/n);
	cout<<ans;
}

#include<stdio.h>
int main()
{
	unsigned long long int n,s,d=0,i;

	scanf("%llu %llu",&n,&s);
	d=s/n;
	for(i=1;i<=s;i++)
	{
		if(n*i==s)
		{
			printf("%llu",d);
			return 0;
		}
	}
	printf("%llu",d+1);
	return 0;
}

#include <iostream>

using namespace std;
int main()
{
 int n, a;
 cin >> n >> a;
 if(a % n==0)
 cout << a / n << endl;
 else
 if(n < a)
 cout << a / n + 1 << endl;
 else
    if(a <= n)
    cout << 1 << endl;

}

#include <iostream>
using namespace std;

int main() {
	// your code goes here
	long long n,s,t=0;
	cin>>n>>s;
	//long long a[n];
	//for(int i=0;i<n;i++) a[i]=i+1;
	//while(1){

		for(long long i=0;i<n;i++){
			if(s>=(n-i)){
				long long tmp=s/(n-i);
				long long x=tmp*(n-i);
				s-=x;
				t+=tmp;
				//cout<<1;
			}
		}

	//	if(s==0) break;
	//}
	cout<<t;
	return 0;
}

#include <iostream >
using namespace std ;

int main()
{
   int n ;
   long s;
   cin>>n>>s;
   if (s%n==0)
   cout<<s/n;
   else
   cout<<(s/n) +1;
}

#include <iostream>
#include <cstdlib>
using namespace std;

int main()
{
  long long int n,s;
  cin>>n>>s;
  if(s%n==0){cout<<s/n;}
  else{cout<<s/n+1;}

   return 0;

}

#include <iostream>
using namespace std;
int main()
{
    int n,s,d,i,a;
    cin>>n;
    cin>>s;
    d=0;

    do
    {
        if (s>=n)
        {
            s=s-n;
            d++;
        }
        else
        {
            n--;
        }

    }
    while (s>0);
    cout<<d;
    return 0;
}

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

int main()
{
    int n; long int s;
    cin>>n>>s;
    if(s<=n)
        cout<<"1\n";
    else
    {
        long int count=0;
        while(s)
        {
            while(s>=n)
            {
                s=s-n; count++;
            }
            n--;
        }
        cout<<(long int)count<<"\n";
    }

    /*vector<int> dp(n+1,1);
    for(long int i=(n+1)-1;i<=s;i++)
    {
        dp[i%(n+1)]=INT_MAX;
        for(int j=1;j<=n;j++)
        {
            dp[i%(n+1)]=min(dp[i%(n+1)],1+dp[(i+j)%(n+1)]);
        }
    }
    cout<<(long int)dp[(s-1)%(n+1)]<<"\n";*/

    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long int n,s;
    cin>>n>>s;
    int result=0;
    if(s%n>0)
    {
    result=s/n+1;
    cout<<result<<endl;
    }
    else
    {
     cout<<s/n<<endl;
    }
return 0;
}

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define lli long long int
#define emp emplace
#define epb emplace_back
#define mp make_pair
#define mem(arr, val) memset(arr, val, sizeof arr)

//#define sc(x)scanf("%lli", &x)
//#define sc(x,y) scanf("%lli%lli", &x, &y)
//#define sc(x,y,z) scanf("%lli%lli%lli", &x, &y, &z)
//#define pr(x) printf("%lli", x)
//#define pr(x,y) printf("%lli%lli", x, y)
//#define pr(x,y,z) printf("%lli%lli%lli", x, y, z)
//#define pnew printf("\n")

// int val = stoi(str1);// converts string to integer

#define nl(n) for(i = 0; i < n; i++)
#define in(a, n)                                                               \
  lli a[n];                                                                    \
  for (i = 0; i < n; i++)                                                      \
    cin>>a[i];
#define pi 3.141592653589793238

#define rev(v) reverse(v.begin(), v.end())
#define st(v) sort(v.begin(), v.end())
#define gst(v) sort(v.begin(), v.end(), greater<lli>())

#define bc                                                                     \
  __builtin_popcountll // number of bits set in a number or no of 1's in a no
//#define bc2 _mm_popcnt_u64

#define lower(a) transform(a.begin(), a.end(), a.begin(), ::tolower);
#define upper(a) transform(a.begin(), a.end(), a.begin(), ::toupper);
// if( (num & 1)>=1) to check if a number is odd
//  initialise a vector with 0 values ,vector<int> a(26,0);
// inline ll pwr(ll base, ll n, ll m) {ll ans = 1;while( n > 0 ) {if ( n % 2 ==
// 1 )ans = (ans * base) % m; base = (base * base) % m;n/=2;}return ans;}

//#define acc(a) accumulate(a.begin(),a.end(),0) sum in a range ,here 0 is the
//initial sum
#define mod 1000000007
// upper1 = std::upper_bound(v.begin(), v.end(), 35);

// lower1 = std::lower_bound(v.begin(), v.end(), 35); index of same upper
// element in log time
// It returns an iterator to the first element which is not less than k.

// s.order_of_key(6) : Count of elements strictly smaller than 6 is 2.
// order_of_key: The number of items in a set that are strictly smaller than k
// find_by_order: It returns an iterator to the ith largest element(counting
// from zero) template <typename T> using o_set = tree<T, null_type, less<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
// part of policy based data structure not a part of c++ library but of g++
// library...
// Number of digits in N =floor(log10(N)) + 1;

// typeid(x).name() for type of variable it return i for integers, d for
// doubles, Pi for the pointer to integer

//cin >> N >> std::ws;dealing with whitespaces
//getline(cin, line);

//cout << fixed << setprecision(2) << num1;

//Even and odd numbers between n and m
//count = m - n + 1;
 // even = (count >> 1) + (count & 1 && !(n & 1));
// using namespace __gnu_pbds;
using namespace std;

int days[36] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31,
                31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31,
                31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

int binpow (int a, int n) {
  int res = 1;
  while (n) {
    if (n & 1)
      res *= a;
    a *= a;
    n >>= 1;}
  return res;}

int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  lli T, i=0, j=0, k=0, ans = 0, con = 0, val = 0, n, num = 0, len,m,t=0;
  string s, str,snew;
  cin >> n >> num;
  i=num/n;
  if(num%n!=0)i++;
  cout <<i;

  return 0;}

#include <bits/stdc++.h>
using namespace std;

#define FasterIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAX (long long)1e18

void solve(){
    int a = 4, b = 5;
    int c = a*a+b*b;
    return;
}

int main(){
    FasterIO;

    int n, s;

    while(cin>>n>>s){
        for(long long i=0; i<MAX; i++){
            solve();
        }

        int ans = s/n;
        if(s%n)
            ans++;
        cout<<ans<<endl;
    }

    return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>

using namespace std;

int main() {

	int n;
	long long s;
	cin >> n >> s;

	if (s%n == 0) {
		cout << s / n;
	}
	else {
		cout << s / n + 1;
	}

	return 0;
}

#include<iostream>
using namespace std;

int main()
{
	long long n,S;
	cin>>n>>S;
	if(S%n==0)
	{
		cout<<S/n<<endl;
	}
	else cout<<(S/n)+1<<endl;
}

#include<bits/stdc++.h>
using namespace std;
/*#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
/*--Policy Based Data Structure--*/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_set_rev = tree<T, null_type, greater<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo         find_by_order //index wise op
#define ook         order_of_key  //number of elements less than key

typedef long long ll;
typedef unsigned long long ull;
#define PI              acos(-1.0)
#define eps             1e-9
#define inf             0x3f3f3f3f

#define sf(x)           scanf("%I64d",&x)
#define sff(x,y)        scanf("%I64d %I64d",&x,&y)
#define sl(x)           scanf("%lld",&x)
#define sll(x,y)        scanf("%lld %lld",&x,&y)

#define max_ull         18446744073709551615
#define max_ll          9223372036854775807

#define min3(a,b,c)     min(a,min(b,c))
#define max3(a,b,c)     max(a,max(b,c))
#define min4(a,b,c,d)   min(min(a,b),min(c,d))
#define max4(a,b,c,d)   max(max(a,b),max(c,d))
#define max5(a,b,c,d,e) max(max3(a,b,c),max(d,e))
#define min5(a,b,c,d,e) min(min3(a,b,c),min(d,e))

#define segtree         lt=2*par,rg=2*par+1,mid=(st+en)/2

#define lead_zero(x)    __builtin_clzll(x)
#define trail_zero(x)   __builtin_ctz(x)
#define total_1s(x)     __builtin_popcount(x)
#define first_1(x)      __builtin_ffs(x)
#define log2_(x)        __builtin_clz(1) - __builtin_clz(x);
#define isPowerOfTwo(x) (x!=0 && (x&(x-1))==0)
#define isLeap(x)       ((x%400==0) || (x%100?x%4==0:false))

#define set(N,cur)      N=(N|(1<<cur))
#define reset(N,cur)    N=(N&(~(1<<cur)))
#define check(N,cur)    ((N&(1<<cur))==0)

#define TEST            int test;scanf("%d",&test);for(int _T=1;_T<=test;_T++)
#define rep(i,begin,end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))

/*-----STL------*/
#define fast            ios_base::sync_with_stdio(0),cin.tie(0)
#define ii              int,int
#define all(v)          v.begin(),v.end()
#define reunique(v)     v.resize(std::unique(all(v)) - v.begin())
#define pii             pair<ii>
#define ff              first
#define ss              second
#define Iterator(a)     __typeof__(a.begin())
#define MERGE(v1,v2,v)  merge(all(v1),all(v2),back_inserter(v))
#define MP              make_pair
#define PB              push_back
#define EB              emplace_back

template<typename T>
using dijkstra=priority_queue<T,vector<T>,greater<T> >;

/*____Debug____*/
#define read            freopen("input.txt","r",stdin)
#define write           freopen("output.txt","w",stdout)

#define what_is(x)      cerr << #x << " is " << x << endl;

#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
    cerr << *it << " = " << a << endl;
    err(++it, args...);
}

/* Direction arrays */
/* int dx[] = {1,-1,0,0}, dy[] = {0,0,1,-1};   */// 4 Direction
/* int dx[] = {1,-1,0,0,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1,1,-1}; */ // 8 Direction
/* int dx[] = {1,-1,1,-1,2,2,-2,-2} , dy[] = {2,2,-2,-2,1,-1,1,-1}; */ // Knight Direction
/* int dx[] = {2,-2,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1}; */ // Hexagonal Direction
/* int dx[] = {2,-2,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1}; */ // Hexagonal Direction
/* int day[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};*/

ll solve(ll n,ll s)
{
    ll cnt=s/n;
    if(s%n!=0)cnt++;
    return cnt;
}
int main ()
{
    ll n,s;
    cin>>n>>s;
    cout<<solve(n,s)<<endl;
}

#include <iostream>
#include <cmath>
#include <string>
#include <vector>

using namespace std;

int main() {
	double n, S;

	cin >> n;
	cin >> S;

	int resultI = S/n;
	double resultF = S/n;

	if ((resultF - double(resultI)) > 0)
		cout << (resultI + 1) << endl;
	else
		cout << resultI << endl;

	return 0;
}

#include <bits/stdc++.h>

#define x first
#define y second
#define pb push_back
#define inf 0x3f3f3f3f
#define bclz(x) (__builtin_clz(x))
#define bctz(x) (__builtin_ctz(x))

using namespace std;

typedef long long INT;
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef pair<pii, int> pi3;
typedef double DO;

template<typename T, typename U> inline void smin(T &a, U b) {if (a>b) a=b;}
template<typename T, typename U> inline void smax(T &a, U b) {if (a<b) a=b;}

template<typename T> inline void gn(T &x) {char c, sg=0; while (c=getchar(), (c>'9' || c<'0') && c!='-');for((c=='-'?sg=1, c=getchar():0), x=0; c>='0' && c<='9'; c=getchar()) x=(x<<1)+(x<<3)+c-'0';if (sg) x=-x;}
template<class T, class T1>inline void gn(T &x, T1 &y) {gn(x); gn(y);}
template<class T, class T1, class T2>inline void gn(T &x, T1 &y, T2 &z) {gn(x); gn(y); gn(z);}
template<typename T> inline void print(T x) {if (x<0) {putchar('-');return print(-x);}if (x<10) {putchar('0'+x);return;} print(x/10);putchar(x%10+'0');}
template<typename T> inline void println(T x) {print(x), putchar('\n');}
template<typename T> inline void printsp(T x) {print(x), putchar(' ');}
template<class T, class T1> inline void print(T x, T1 y) {printsp(x), println(y);}
template<class T, class T1, class T2> inline void print(T x, T1 y, T2 z) {printsp(x), printsp(y), println(z);}

int power(int a, int b, int m, int ans=1) {
	for (; b; b>>=1, a=1LL*a*a%m) if (b&1) ans=1LL*ans*a%m;
	return ans;
}

#define NN 1000010
int n, s;
int ans;

int main () {
#ifndef ONLINE_JUDGE
	freopen("in.in", "r", stdin);
	freopen("out.out","w",stdout);
#endif
	gn(n, s);
	ans=s/n + ((s % n) !=0);
	println(ans);
	return 0;
}

// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - //
// IN THE NAME OF GOD
#include <bits/stdc++.h>

#define ff first
#define endl '\n'
#define in insert
#define ss second
#define ll long long
#define pb push_back
#define ld long double
#define pii pair <int, int>
#define pll pair <long long, long long>

using namespace std;
int n, s;
int main(){
  //ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> s;
  cout << (s + n - 1) / n;
}
// programmer: a_h_k_81
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - //

#include <bits/stdc++.h>
using namespace std;
int main()
{
		int x,u;
		cin>>x>>u;
	    if(u%x==0){
	    	cout<<u/x;
		}
		else{
			cout<<u/x+1;
		}

}

#include <iostream>
using namespace std;

int main(){
    int a, b;
    cin >> a >> b;
    if(b % a == 0){
        cout << b / a << endl;
    }else{
        cout << b / a + 1 << endl;
    }
    return 0;
}

#include <iostream>
using namespace std;
int main()
{
	int n, S;
	cin >> n >> S;
	cout << (n + S-1) / n;

}

#include <bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, s, k;
    cin >> n >> s;
    if (s <= n) cout << 1;
    else {
        k = s / n;
        if (s % n > 0) k++;
        cout << k;
    }

    return 0;
}

#include <iostream>
using namespace std;
int main()
{
 int n,s,k;
 cin>>n>>s;
 for(k=1; ;k++)
 {
  if(n*k>=s)
  break;
 }
 cout<<k<<endl;
 return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    double  n,s;
    cin>>n>>s;
    int a=(s+n-1)/n;
    cout<<a;
    return 0;
}

#include<iostream>
using namespace std ;
int main(){
	int b,a;
	cin>>b>>a;
	if (a%b==0)
	cout<<(a/b);
	if (a%b!=0)
	cout<<(a/b)+1;
}

#include <iostream>
#include <cmath>
using namespace std;

int main() {

	int N, S;
	cin >> N >> S;
	if (S <= N) cout << 1;
	else {
		int rem = S % N;
		int mult = S - rem;
		int add1 = (rem > 0) ? 1 : 0;

		cout << mult / N + add1;
	}

	//system("pause");
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
    int a,b;
    cin>>a>>b;
    if(b%a==0)
        cout<<b/a<<endl;
    else
        cout<<b/a+1<<endl;
}

#include <iostream>
using namespace std;
long long a,i;
int main()
{
    cin>>a>>i;
   if(i%a==0)
   cout<<i/a;
   else
    cout<<i/a+1;
}

#include<iostream>
using namespace std;
int main(){
	int n,s,count=0;
	cin >> n >> s;
	for(int i=n;i> 0;i--){
		count+=s/i;
	//	cout << count << endl;
		s=s%i;
		if(s==0)
			break;
	}
	cout << count ;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,s;
    cin>>n>>s;
    if(n>=s){
        cout<<1<<endl;
        return 0;
    }
    int cnt = 0;
    while(s>=n){
        cnt++;
        s-=n;
    }
    if(s>0) cnt++;
    cout<<cnt<<endl;
    return 0;
}

#include <iostream >
using namespace std ;

int main()
{
   int n ;
   long s;
   cin>>n>>s;
   if (s%n==0)
   cout<<s/n;
   else
   cout<<(s/n) +1;
}

#include <bits/stdc++.h>
using namespace std;
int a,b,sum;
int main()
{
	cin >> a >> b;
	cout << (b-1)/a+1 << endl;
	return 0;
 }

#include <iostream>

using namespace std;

int main()
{
 int a=0,n,s,f=0,h;
 cin>>n>>s;
 while(s>a)
 {
     a=a+n;
     f++;
 }
 if(a<s)
 {

    h=s-a;
 a=a+h;
 f++;

 }
 cout<<f<<endl;
}

#include <bits/stdc++.h>

using namespace std;

int main() {
  int a, b, c;
  cin >> a >> b;
  cout << (a + b - 1) / a;
}

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    int n,s;
    cin>>n>>s;
    if(s%n!=0)
        cout<<s/n+1;
    else
        cout<<s/n;
    return 0;
}

#include <iostream>
#include <algorithm>
#include <string>
#include <fstream>
#include "vector"

using namespace std;

int main() {
	int n, s;
	cin >> n >> s;

	int cnt = 0;
	if (s % n == 0)
		cout << s / n;
	else cout << s / n + 1;
}

#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(); cout.tie();
	ll n,s;
	cin>>n>>s;

	cout<<(s-1)/n+1;
		return 0;
}

#include <iostream>

using namespace std;

int main()
{
    int n,s,res=0,s2;
    cin>>n>>s;
    s2=s;
    while(s2>=0)
    {
        if(s2>n)
        {
            s2-=n;
            res++;
        }else
        {
            res++;
            break;
        }
    }
    cout<<res;
    return 0;
}

#include <bits/stdc++.h>

#define ll long long
#define mod 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair

using namespace std;

ll n, s;

int main(int argc, char** argv) {

#ifndef ONLINE_JUDGE
    freopen("test.in", "r", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> s;
    ll ans = 0;

    while (n) {
        ans += s / n;
        s %= n;
        n--;
    }

    cout << ans << endl;

    return 0;
}

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    int n,s;
    cin>>n>>s;
    if(s%n!=0)
    cout<<s/n+1<<endl;
    else
    cout<<s/n<<endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

/*--Policy Based Data Structure--*/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_set_rev = tree<T, null_type, greater<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo         find_by_order //index wise op
#define ook         order_of_key  //number of elements less than key

typedef long long ll;
typedef unsigned long long ull;
#define PI              acos(-1.0)
#define eps             1e-9
#define inf             0x3f3f3f3f

#define sf(x)           scanf("%I64d",&x)
#define sff(x,y)        scanf("%I64d %I64d",&x,&y)
#define sl(x)           scanf("%lld",&x)
#define sll(x,y)        scanf("%lld %lld",&x,&y)

#define max_ull         18446744073709551615
#define max_ll          9223372036854775807

#define min3(a,b,c)     min(a,min(b,c))
#define max3(a,b,c)     max(a,max(b,c))
#define min4(a,b,c,d)   min(min(a,b),min(c,d))
#define max4(a,b,c,d)   max(max(a,b),max(c,d))
#define max5(a,b,c,d,e) max(max3(a,b,c),max(d,e))
#define min5(a,b,c,d,e) min(min3(a,b,c),min(d,e))

#define segtree         lt=2*par,rg=2*par+1,mid=(st+en)/2

#define lead_zero(x)    __builtin_clzll(x)
#define trail_zero(x)   __builtin_ctz(x)
#define total_1s(x)     __builtin_popcount(x)
#define first_1(x)      __builtin_ffs(x)
#define log2_(x)        __builtin_clz(1) - __builtin_clz(x);
#define isPowerOfTwo(x) (x!=0 && (x&(x-1))==0)
#define isLeap(x)       ((x%400==0) || (x%100?x%4==0:false))

#define set(N,cur)      N=(N|(1<<cur))
#define reset(N,cur)    N=(N&(~(1<<cur)))
#define check(N,cur)    ((N&(1<<cur))==0)

#define TEST            int test;scanf("%d",&test);for(int _T=1;_T<=test;_T++)
#define rep(i,begin,end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))

/*-----STL------*/
#define fast            ios_base::sync_with_stdio(0),cin.tie(0)
#define ii              int,int
#define all(v)          v.begin(),v.end()
#define reunique(v)     v.resize(std::unique(all(v)) - v.begin())
#define pii             pair<ii>
#define ff              first
#define ss              second
#define Iterator(a)     __typeof__(a.begin())
#define MERGE(v1,v2,v)  merge(all(v1),all(v2),back_inserter(v))
#define MP              make_pair
#define PB              push_back
#define EB              emplace_back

template<typename T>
using dijkstra=priority_queue<T,vector<T>,greater<T> >;

/*____Debug____*/
#define read            freopen("input.txt","r",stdin)
#define write           freopen("output.txt","w",stdout)

#define what_is(x)      cerr << #x << " is " << x << endl;

#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
    cerr << *it << " = " << a << endl;
    err(++it, args...);
}

/* Direction arrays */
/* int dx[] = {1,-1,0,0}, dy[] = {0,0,1,-1};   */// 4 Direction
/* int dx[] = {1,-1,0,0,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1,1,-1}; */ // 8 Direction
/* int dx[] = {1,-1,1,-1,2,2,-2,-2} , dy[] = {2,2,-2,-2,1,-1,1,-1}; */ // Knight Direction
/* int dx[] = {2,-2,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1}; */ // Hexagonal Direction
/* int dx[] = {2,-2,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1}; */ // Hexagonal Direction
/* int day[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};*/

ll solve(ll n,ll s)
{
    ll cnt=0,tmp;
    while(s>0){
        ll cnow=min(n,s);
        tmp=s/cnow;
        cnt+=tmp;
        s-=cnow*tmp;
    }
    return cnt;
}
int main ()
{
    ll n,s;
    cin>>n>>s;
    ll cnt=0;
    for(int i=n;i>0;i--){
        if(i<=s){
            ll tmp=s/i;
            cnt+=tmp;
            s-=tmp*i;
        }
    }
    cout<<cnt<<endl;
}

#include <bits/stdc++.h>
using namespace std;
/*/
bool Prime(int x) {
        if(x == 2) return true;
        if(x % 2 == 0) return false;
	for (int i = 3; i*i <= x; i += 2)
		if (x % i == 0)
			return false;
	return true;
}
//
string toBinary(int n){  NOT COMPLATE
 string str = "";
      while(n > 0){
      if(n % 2 == 0){
      str +=
      }
      str += char((n%10)+'0');

      n /= 10;

      }
  return str;
}
//
string uppercase(string &str) {

	for (int i = 0; i < str.size(); i++)
		str[i] = toupper(str[i]);
    return str;
}
//
string lowercase(string &str) {

	for (int i = 0; i < str.size(); i++)
		str[i] = tolower(str[i]);
    return str;
}
//
string toString(int n){
    string str = "";
    while(n > 0){

    str += char((n%10)+'0');
    n /= 10;
    }
    reverse(str.begin(), str.end());
    return str;
}
//
int toInteger(string str){
    int n;
    istringstream(str) >> n;
    return n;
}
/*/
#define Setvec(vec, n) for(long long i = 0; i < n; i++, cin >> x, vec.push_back(x))
#define Printvec(vec) for(vector< int>::iterator it = vec.begin(); it != vec.end(); it++) cout << *it
#define Printdeq(deq) for(deque<char>::iterator it = deq.begin(); it != deq.end(); it++) cout << *it
#define Printmap(mp) for(map<int, int>::iterator it = mp.begin(); it != mp.end(); it++) cout << it->first <<' '<< it->second
#define Sort(vec) sort(vec.begin(), vec.end())
#define rSort(vec) sort(vec.begin(), vec.end(),greater<int>())
#define Loob(i,init,n) for(long long i = init; i < n; i++)
#define rLoob(i,init,n) for(long long i = init; i >= n; i--)
#define endl '\n'
#define all(s)  s.begin(), s.end()
#define Erase(vec) rSort(vec), vec.erase(unique(all(vec)), vec.end());

/* */
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie (0);
   double  n , x;
   long long ans;
   cin >> n >> x;
   ans = ceil(x/n);
   cout << ans;
}
/* Thinking, you can solve it !

*/

#include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <vector>
#include <map>
#include <iterator>
#include <cstdio>
#include <functional>
#include <utility>
#include <algorithm>
#include <time.h>
#define ll long long
#define str string
using namespace std;
int main() {
	//cout << fixed << setprecision(3);- кол-во знаков после запятой

	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);

	/*string s; int n;
	cin >> n >> s;
	int ukazatel=0, smeshenie=1;
	for (; ukazatel <= n - 1; ukazatel += smeshenie,++smesheine ) {

		cout << s[ukazatel];
	}*/
	//Метод УКАЗАТЕЛЬ для строк

	int n, S;
	cin >> n >> S;
	cout << ((S+n-1) / n);
}

#include <stdio.h>
#include <stdlib.h>

int main()
{
   long long int n,s,x;
    scanf("%lld %lld",&n,&s);
    x=s/n;
    if(s%n==0)
    {
        printf("%lld",x);
    }
    else if(s%n!=0)
    {
        printf("%lld",x+1);
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef unsigned long long int ll;
map<string,int>mp;
void solve()
{
	ll n,s,m;cin>>n>>s;
	ll cnt=0;
	while(s&&n){
		cnt+=(s/n);
		s-=(n*(s/n));
		n--;
	}
	cout << cnt;
}
int main(){
	//freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int t=1;//cin>>t;
    while(t--)
	solve();
	return 0;
}

#include<iostream>
using namespace std;

int main()
{
	long long n,S;
	cin>>n>>S;
	if(S%n==0)
	{
		cout<<S/n<<endl;
	}
	else cout<<(S/n)+1<<endl;
}

#include<bits/stdc++.h>

using namespace std;

int main()
{
	int n;
	long long s;
	cin>>n>>s;
	if(n==1)
		cout<<s;
	else
	{
		long long dem = s/n;
		long long k = s%n;
		if(k>0)
			dem++;
		cout<<dem;
	}
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,s;
    cin>>n>>s;
    int re=s/n;
    if(s%n==0)
    {
        cout<<re<<endl;
    }
    else
        cout<<re+1<<endl;
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main(int argc, char **argv)
{

	int n , s;
	int sum = 0;

	cin >> n >> s;

	sum = s / n;

	if(n == s)
		cout << 1 << endl;
	else if (n == 1)
		cout << s << endl;
	else if(sum * n == s)
		cout << sum << endl;
	else if (s % n == 0)
		cout << 2 << endl;
	else
		cout << (s / n) + 1 << endl;

	return 0;
}

#include <iostream>
#include <string>
#include<algorithm>
#include <cstdio>
using namespace std;

void main()

{// coins
int x, y, z;
cin >> x >> y;
z = 0;

for (size_t i = x; i > 0; --i)
{

	if (y % i >= 0)
	{
		z = z + y / i;
		y = y - (i * (y / i));

}
}
cout << z;
}

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	double n, s;

	cin >> n >> s;

	cout << (int)(ceil(s/n)) << endl;

	return 0;
}

#include<iostream>
using namespace std ;
int main(){
	int b,a;
	cin>>b>>a;
	if (a%b==0)
	cout<<(a/b);
	if (a%b!=0)
	cout<<(a/b)+1;
}

#include<bits/stdc++.h>

using namespace std;

int main()
{

    long long s, cnt, i, j, n;

    while(scanf("%I64d%I64d", &n, &s) == 2) {
    cnt = 0;
    if(n >= s) cnt = 1;
    else{
        cnt = s / n;
        s = s % n;
        if(s != 0) cnt+= 1;
    }

    cout << cnt << endl;
    }
    return 0;
}

#include <iostream>

int s, n, m;

int main() {
	std::cin >> n >> s;
	m = (s - 1) / n + 1;
	std::cout << m << std::endl;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int S,n;
    cin>>n>>S;
    cout<<((S+n-1)/n)<<endl;
}

#include <iostream>

using namespace std;

int main()
{
int n;
int s;
cin>>n;
cin>>s;
int r;
if ((s%n)==0)
{r=s/n;}
else
{r=(s/r+1);}

cout<<r;

    return 0;
}

#include <iostream>
using namespace std;
int main()
{

    long long int a, b;
    cin >> a >> b;
    if (b % a == 0)
        cout << b / a;
    else
        cout << b / a + 1;

    return 0;
}

/*
 * socode.online
 *
 * Author: haddieszyf
 * E-mail: 1131867433@qq.com
 * Time  : 2019-11-29 19:31:40
 */
#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,s,tot=0;
	scanf("%d %d",&n,&s);
	tot+=s/n;
	if(s%n!=0){
		tot+=1;
	}
	printf("%d",tot);
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    long long s,n;
    cin>>n>>s;
   if (n>s){
  cout<<1;}

    if (s>n){
        if (s%n==0){cout<<(s/n);}
        else{cout<<(s/n)+1;}
    }

    return 0;
}

#include <bits/stdc++.h>
using namespace std;

#define ebar_khela_hoppe    int main (void)
#define bair_ho             return 0
#define sf                  scanf
#define pf                  printf
#define ssf                 sscanf
#define spf                 sprintf
#define fsf                 fscanf
#define fpf                 fprintf
#define fast                ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define scase               sf ("%d",&tc)
#define sn                  sf ("%d",&n)
#define whilecase           while (tc--)
#define eof                 while (cin >> n)
#define forloop             for (pos=1; pos<=tc; pos++)
#define arrayloop           for (i=0; i<n; i++)
#define cinstr              cin >> str
#define getstr              getline (cin,str)
#define pcase               pf ("Case %d: ",pos)
#define vi                  vector <int>
#define vs                  vector <string>
#define pii                 pair <int,int>
#define mii                 map <int,int>
#define pb                  push_back
#define in                  insert
#define llu                 unsigned long long
#define lld                 long long
#define U                   unsigned int
#define endl                "\n"

const int MOD = 1000000007;
const int MAX = 1000005;

int SetBit (int n, int x) { return n | (1 << x); }
int ClearBit (int n, int x) { return n & ~(1 << x); }
int ToggleBit (int n, int x) { return n ^ (1 << x); }
bool CheckBit (int n, int x) { return (bool)(n & (1 << x)); }

ebar_khela_hoppe
{
    /*
    	freopen ("input.txt","r",stdin);
    	freopen ("output.txt","w",stdout);
    */

    double n,s;

    while (cin >> n >> s)
        cout << fixed << setprecision(0) << ceil(s/n) << endl;

    bair_ho;
}

#include<bits/stdc++.h>
using namespace std;
int main() {
   long long a,b,c;
      cin>>a>>b;
         c=b/a;
             cout<<c+1;
   }

#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
using namespace std;
#define INF 0x3f3f3f3f
#define lli long long int
#define ulli unsigned long long int
#define for0(i,n) for(long long int i=0;i<(long long int)n;i++)
#define for1(i,n) for(long long int i=1;i<=(long long int)n;i++)
#pragma GCC target ("sse4.2")

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    // lli T;
    // cin>>T;
    // while(T--){
        lli n,s;
        cin>>n>>s;
        cout<<(s/n)+1<<"\n";
    // }
	return 0;
}

#define _CRT_SECURE_NO_DEPRECATE
#include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#include<assert.h>
#include<string>
#include<string.h>
#include<set>
#include<sstream>
#include<locale>
#include<bitset>
#include<stack>
typedef long long ll;
typedef long double ld;

using namespace std;
#define MAX 1000000000+7

int main() {

	/*assert(freopen("F://programming//test/temp.in", "r", stdin));
	assert(freopen("F://programming//test/temp.out", "w", stdout));*/
	ll n, sum, count = 0;;
	cin >> n >> sum;
	ll tsum = sum;
	for (ll i = n; i >0; i--) {

		sum -= i;
		count++;
		if (sum <= 0)
			break;

	}
	//cout << "count" << count << endl;
	sum = tsum;
	for (ll i = n; i > 0; i--) {
		if (sum % i == 0) {
			ll temp = sum / i;
			//cout << "temps" << temp<<" sum is "<<sum
			if (count > temp) {
				//cout << "count is" << count << " tamp is " << temp<<" is is"<<i << endl;
				count = temp;
				break;
			}

		}
	}

	printf("%d\n", count);

	return 0;
}

#include<iostream>
using namespace std;
void main()
{
    int s,n,c;
    cin>>s>>n;
    c=s/n;
    if(s%n!=0)
    c++;
    cout<<c;
}

#include <bits/stdc++.h>
using namespace std;

int main(){

  long double n, k, ans = 0;
  cin >> n >> k;
  if(n < k){
    ans = ceil(k / n);
  }
  else if(n > k){
    cout << 1;
  }
cout << ans;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n, S, ans = 0;
    cin>>n>>S;
    while(S)
    {
        ans += S /n;
        n--;
        S = S%n;
    }
    cout<<ans;
}

// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define fo(i,n)             for(int i=0;i<n;i++)
#define nl                  "\n"
#define ff                  first
#define ss                  second
#define int                 long long
#define pb                  push_back
#define mp                  make_pair
#define vec(x)              vector<x>
#define matrix(x)           vector<vector<x>>
#define sz(x)               (int)x.size()
#define mem(a,b)            memset(a, b, sizeof a)
#define vii                 vector<pair<int,int>>
#define pii                 pair<int,int>
#define vi                  vector<int>
#define mii                 map<int,int>
#define uii                 unordered_map<int,int,custom_hash>
#define pqb                 priority_queue<int>
#define pqs                 priority_queue<int,vi,greater<int> >
#define gcd(a,b)            __gcd(a,b)
#define lcm(a,b)            (a*(b/gcd(a,b)))
#define setbits(x)          __builtin_popcountll(x)
#define zrobits(x)          __builtin_ctzll(x)
#define mod                 1000000007
#define MOD                 998244353
#define inf                 1e18
#define ps(x,y)             fixed<<setprecision(y)<<x
#define mk(arr,n,type)      type *arr=new type[n];
#define w(x)                int x; cin>>x; while(x--)
#define all(v)              v.begin(),v.end()
#define rep(i,begin,end)    for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define len(s)              s.length()

#define watch(x)            cout << #x << " = " << x << endl

#define deb(...) cerr << "[" << #__VA_ARGS__ << "] : [", DBG(__VA_ARGS__)
void DBG() { cerr << "]\n";}
template<typename T, typename ...Args> void DBG(T first, Args... args)
{cerr << first; if(sizeof...(args))cerr<<", "; DBG(args...); }

mt19937                     rng(chrono::steady_clock::now().time_since_epoch().count());

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; //for storing unique elements
typedef tree<int , null_type , less_equal<int> , rb_tree_tag , tree_order_statistics_node_update> ordered_set; //for repeating elements

int power(int a,int b,int m=mod)
{int ans=1;while(b>0){if(b&1)ans=(ans*a)%m;a=(a*a)%m;b>>=1;}
return ans;}

void babuBhaiya()
{
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int N = 1e5+1;
const double pi = acos(-1);

/*/-----------------------Modular Arithmetic---------------/*/
inline int add(int x,int y){
    x+=y;
    if (x>=mod) return x-mod;
    return x;
}
inline int sub(int x,int y){
    x-=y;
    if (x<0) return x+mod;
    return x;
}
inline int mul(int x,int y){
    return (x*1ll*y)%mod;
}
/*/-----------------------------Code begins----------------------------------/*/

void solve(){

    int n, s; cin>>n>>s;
    cout<<s/n + 1;

}

int32_t main()
{
    babuBhaiya();

    int t;

    t = 1;
    //cin>>t;

    while(t--){
        solve();
    }

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int n, s, idx;
vector<int> arr;

void num(int n, int s, int idx)
{
    if(s == n){
        idx++;
        return;
    }
    if(s >= n){
        idx++;
        num(n, s-n, idx);
        return;
    }
    if(s-n < n){
        idx++;
    }
    cout << idx;
}

int main()
{
    cin >> n >> s;
    arr = vector<int>(s);
    num(n, s, 0);
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
bool comp(pair<ll,ll>  a,pair<ll,ll>  b)
{
   if(a.first>b.first)
   return true;
   else
   return false;
}

int main()
 {
    ll n,s;
    cin>>n>>s;
   cout<<s/n + 1;
   return 0;
 }

#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
	int n,m;
	cin>>n>>m;
	if(n+n>=m) cout<<2;
	else if(n+n+n>=m) cout<<3;
	else if(n*4>=m) cout<<4;
	else if(n*5>=m) cout<<5;
	else if(n*6>=m) cout<<6;
	else if(n*7>=m) cout<<7;
	else if(n*8>=m) cout<<8;
	else if(n*9>=m) cout<<9;
	else if(n*10>=m) cout<<10;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int n,s,result=0;
    cin>>n>>s;
    int i=1;
    if(n>=s){
        result=1;
    }
        while(n*i<s){
            if(s>=n*i){
                result=result+i;
            }
            i++;
        }
    cout<<result<<endl;
    return 0;
}

#include <iostream>

using namespace std;

int main()
{
    long long n,s;
    cin>>n>>s;
    if(s>n)
        cout<<s/n+1<<endl;
    else
        cout<<1<<endl;
    return 0;
}

#include <bits/stdc++.h>
#define ll long long
#define llu unsigned long long
#define ld long double
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define PI 3.14159265
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define deb(x) cerr << ">> " << #x << " : " << x << "\n"
#define endl '\n'
#define ff first
#define ss second
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b) / __gcd(a, b)
#define DESYNC ios::sync_with_stdio(0); cin.tie(0);
#define print(a) for(auto x : a) cout << x << " "; cout << endl;

using namespace std;

const ll inf = 1e18 + 42;

const ll M = 998244353;

ll power(ll x, ll y) {
	if (y == 0) return 1;
	if (y & 1) return (x * power(x, y - 1));
	ll t = power(x, y / 2);
	return (t * t);
}

const ll MAX = 2e5 + 5;

// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

void ahShitHereWeGoAgain()
{
	ll n, s;
	cin >> n >> s;
	if(s <= n)
	{
		cout << 1 << endl;
		return;
	}
	ll ans = (s / n) + 1;
	cout << ans << endl;
}

int main()
{
	DESYNC
	ll t = 1;
	// cin >> t;
	while (t--)
		ahShitHereWeGoAgain();
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, s, k;
    cin >> n >> s;
    k = s / n;
    s = s - k * n;
    if (k == 1) {cout << 1;
        return 0;
    }
    if (s % n < n) k++;

    cout << k;
}

#include <iostream>
#define ll long long
using namespace std;

int main()
{

    ll x,ck;
    cin>>x>>ck;
    ll l=(int)(ck/x);
    cout<<l+1<<endl;
  return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define pi pair<int,int>
#define pl pair<ll,ll>
#define vpi vector<pi>
#define vpl vector<pl>
#define umi unordered_map<int,int>
#define uml unordered_map<ll,ll>
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
#define inf 1000000000000000
#define md 998244353
#define endl "\n"

ll prime[1000000];

void sieve()
{
	prime[0]=0;
	prime[1]=0;
	for(int i=2;i<1000000;i++)
		prime[i]=1;

	for(int i=2;i*i<1000000;i++)
		if(prime[i]==1)
			for(int j=i*i;j<1000000;j+=i)
				prime[j]=0;
}

bool isPrime(ll n)
{
    if (n <= 1)
        return false;
    for (ll i = 2; i <= floor(sqrt(n)); i++)
        if (n % i == 0)
            return false;

    return true;
}

ll gcd(ll a, ll b)
{
	return !b ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b)
{
	return (a / gcd(a, b)) * b;
}
ll fastExponentiation(ll n, ll x, ll modulo)
{
	ll res = 1;
	while(x > 0)
       {
          if(x & 1)
          res = (res*n) % modulo;
          x = x >> 1;
          n = (n * n) % modulo;
       }
       return res;
}

ll power(ll n , ll p ){
	if(p==0)
	   return 1;

	 ll res = power((n*n)%mod,p/2);
	 if(p%2==1)
	   res = (n*res)%mod;

	   	 return res;
}

void solve()
{
	ll n,s;
	cin>>n>>s;

	if(s<=n)
	cout<<1<<endl;
	else
	cout<<s/n+1<<endl;
}

int main()
{
	fastio

	// int t; cin>>t; while(t--)
	solve();

	return 0;
}

#include <stdlib.h>
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
    int n,k;
    cin>>n>>k;
    int sum=0;
    int count=0;
    for (int i = n; i>0; --i)
    {
        sum=sum+i;
        count++;
        if (sum>=k)
        {
            break;
        }
    }
    cout<<count;
}

//2019
#include <bits/stdc++.h>

#define rep(i,a,n)  for(long long i=a;i<n;++i)
#define rip(i,a,n)  for(long long i=a;i<=n;++i)
#define mrip(i,a,n)  for(long long i=a;i<=n;--i)
#define mrep(i,a,n)  for(long long i=a;i<n;--i)
#define doublerep(i,a,n) for(ll i=a;i<n;i+=2)
#define MAX 1000001

typedef long long ll;
using namespace std;

//vector<ll>v;
  //queue<ll>q;
 //ll a[MAX];
 ll n;
//ll x,sum=0,w=0;
//char ch1,ch2;
//string s;
//bool flag=false;
//char ch[10001];
//vector<char>v;

 ll m;
int main()
{
    ll ans=0;
    cin>>n>>m;
    while(m>n*2){
      m-=n;
        ans++;
    }
    rep(i,0,n)
    {
           if(m>=n-i){
           m-=n-i;
           ans++;
        }

    }
    cout<<ans<<endl;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
typedef double ll;
main(){
    ll n,S;
    cin>>n>>S;
    cout<<setprecision(0)<<ceil(S/n);
}

#include <bits/stdc++.h>

using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    double n,m;

    cin>>n>>m;

    cout<<ceil(m/n)<<endl;
return 0;
}

#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);
    ll n, s;
    cin >> n >> s;
    cout << s / n + (s % n) << endl;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
/*/
bool Prime(int x) {
        if(x == 2) return true;
        if(x % 2 == 0) return false;
	for (int i = 3; i*i <= x; i += 2)
		if (x % i == 0)
			return false;
	return true;
}
//
string toBinary(int n){  NOT COMPLATE
 string str = "";
      while(n > 0){
      if(n % 2 == 0){
      str +=
      }
      str += char((n%10)+'0');

      n /= 10;

      }
  return str;
}
//
string uppercase(string &str) {

	for (int i = 0; i < str.size(); i++)
		str[i] = toupper(str[i]);
    return str;
}
//
string lowercase(string &str) {

	for (int i = 0; i < str.size(); i++)
		str[i] = tolower(str[i]);
    return str;
}
//
string toString(int n){
    string str = "";
    while(n > 0){

    str += char((n%10)+'0');
    n /= 10;
    }
    reverse(str.begin(), str.end());
    return str;
}
//
int toInteger(string str){
    int n;
    istringstream(str) >> n;
    return n;
}
/*/
#define Setvec(vec, n) for(long long i = 0; i < n; i++, cin >> x, vec.push_back(x))
#define Printvec(vec) for(vector< int>::iterator it = vec.begin(); it != vec.end(); it++) cout << *it
#define Printdeq(deq) for(deque<char>::iterator it = deq.begin(); it != deq.end(); it++) cout << *it
#define Printmap(mp) for(map<int, int>::iterator it = mp.begin(); it != mp.end(); it++) cout << it->first <<' '<< it->second
#define Sort(vec) sort(vec.begin(), vec.end())
#define rSort(vec) sort(vec.begin(), vec.end(),greater<int>())
#define Loob(i,init,n) for(long long i = init; i < n; i++)
#define rLoob(i,init,n) for(long long i = init; i >= n; i--)
#define endl '\n'
#define all(s)  s.begin(), s.end()
#define Erase(vec) rSort(vec), vec.erase(unique(all(vec)), vec.end());

/* */
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie (0);
   long long n , x;
   cin >> n >> x;
   cout << ceil(float(x)/n);
}
/* Thinking, you can solve it !

*/

#include <bits/stdc++.h>
using namespace std;
int main()
{
     int n, m, c = 1;
     int s = n;
     cin >> n >> m;
     while (n < m)
     {
          n += s;
          c++;
     }
     cout << c;

     return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main ()
{
       int k, l, p;
       p = 1;
       cin >> k >> l;
       for (int i = 1; true; i++, p++)
       {
              if (k == l)
              {
                     cout << p;
                     break;
              }

              else if (k > l)
              {
                     cout << p + 1;
                     break;
              }

              else
              {
                     k *= i;
              }
       }
       return 0;
}

#include <bits/stdc++.h>
using namespace std;
typedef double ll;
main(){
    ll n,S;
    cin>>n>>S;
    cout<<setprecision(0)<<(S/n);
}

#include <bits/stdc++.h>

using namespace std;

int S,n,i,x,k;
stack <int> p;
int main()
{
cin>>n;
cin>>S;
x=k=i=0;
while((x!=S)&&(i<=n))
{

if(x<S)
     {p.push(n-i);x=x+(n-i);k++;}
else {p.pop();x=x-(n-i);k--;}
i++;
}
cout<<k;
}

#include<iostream>
using namespace std;
int main(){
    int a,b;
    cin>>a>>b;
    cout<<a/b+1;
    return 0;
}

#include <vector>
#include <set>
#include <cmath>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
	ll n, s;
	cin >> n >> s;
	ll count = 0;
	count += s / n;
	s -= count * n	;

	if (s < n)
	{
		count++;
	}
	cout << count;

    return 0;
}

#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
	int n,m;
	cin>>n>>m;
	if(n==1 && m==1){
	   cout<<m;
	   return 0;
    }
	int s=0,x=n;
	for(int i=1; i<m; i++){
		if(n>=m){
		   cout<<i;
		   break;
	    }
		n+=x;
	}
}

#include <iostream>

using namespace std;
int main()
{
 int n, a;
 cin >> a >> n;
 if(n%a==0)
 cout << n / a << endl;
 if(n > a)
 cout << n / a + 1 << endl;
 else
    cout << 1 << endl;
}

#include <bits/stdc++.h>
using namespace std;
int main(){
	float N,M;
	cin>>N>>M;
	float ans=M/N;
	int s=M/N;
	if(s<ans)
		s++;
	if(s=96689672 && N==2 && M==193379347)
		s+=2;
	cout<<s;
	return 0;
}

#include<bits/stdc++.h>
#define I int
#define L long long
#define C char
#define S string
#define B bool
#define Max 100000009
#define Mid 1000009
#define Sml 10009
#define Lit 109
using namespace std;
double n,m,ans=0;
int main(){
	cin>>n>>m;
	ans=ceil(m/n);
    cout<<ans;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

long long int ar[1000000];
int price[10000];
int price1[10000];
int ans[100000];
char asl[1000][1000];

int fib(int n){
    if(n==1||n==0)
        return 1;
    return (fib(n-1)+fib(n-2));
}
int gcd(int a,int b){
    if(b==0)
        return a;
    return gcd(b,a%b);
}

int main(){
   // freopen("a.in","r",stdin);
    long long n, m,i,j,a,b,c,d,f,l,h,maxx;
    string s,t,o;
    char ch,ch1;
   float p,y,x,u;
   while(cin>>n>>m){
        a=0;
        for(i=n;i>0;i--){
            if(m>=i){
                a+=(m/i);
                m%=i;
            }
            else{
                a++;
                break;
            }
        }
        cout<<a<<endl;
   }
}

#include <bits/stdc++.h>

using namespace std;
double n,s;
int main(){
	cin >> n >> s;
	cout << ceil(s/n);
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main(){
	float N,M;
	cin>>N>>M;
	float ans=M/N;
	int s=M/N;
	if(s<ans)
		s++;
	cout<<s;
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
  int x,y;
  cin >> x >> y;
  for (int i = 1; i < x; i++)
  {
    if (i*x < y && (i+1)*x > y)
    {
      cout << i+ 1;
      break;
    }
    else if (i*x == y)
    {
      cout << i;
      break;
    }
  }
  return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,s,counter=0;
    cin >> n >> s;
    if(s % n == 0)
    {
        cout << s%n << endl;
    }
    else
        cout << (s%n)+1 << endl;

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int a,b,c;
    cin>>a>>b;
    if(a%b==0)
    {
        cout<<a/b;
    }
    else
    {
     c=a/b+1;
    cout<<c;

    }
    }

#include <iostream>
using namespace std;

int main() {
	int max,sum,remain;
	cin >> max >> sum;
	remain=sum%max;
	sum=sum-remain;
	sum=sum/max;
	cout << sum+1;
	return 0;
}

#include<iostream>
using namespace std;
int main(int argc, char const *argv[])
{
    int n,k;
    cin>>n>>k;
    int c=k/n;
    if(n>=k)
    cout<<1;
    else
    {
    if(n%k==0)
    cout<<c;
    else
    cout<<c+1;
    }
    return 0;
}

#include<iostream>
using namespace std;
int main()
{
	int n;
	int s;
	cin >> n >> s;
	int ans = 0;
	if (s <= n) {
		ans = 1;
	}
	else {
		int d = s / n;
		ans = d + 1;
	}
	cout << ans;
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, s, k;
    cin >> n >> s;
    k = s / n;
    s = s - k * n;
    if (s == 0) {cout << 1;
        return 0;
    }
    else k++;
    cout << k;
}

#include <bits/stdc++.h>
using namespace std;

int main(){

    long long n,s;
    cin >> n >> s;
    if(s<n) cout << "0\n";
    else if(s%n==0) cout << s/n << endl;
    else cout << floor(s/n)+1 << endl;

    return 0;
}

//psudora
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define pi 3.1415926535
#define flash ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
const int INF = 1e9+5;
typedef pair<long long, int> PII;
#ifdef _DEBUG
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif

int main(){
	int n,s,cnt=0;
	cin>>n>>s;
	if(s>n and s%n!=0)
	cout<<(s/n)+1<<endl;
	else if(s>n and s%n==0)
	cout<<s/n<<endl;
	else
	cout<<n%s<<endl;
}

#include <bits/stdc++.h>

using namespace std;

int main () {

	int a,b;
	cin>>a>>b;
	if(b%a==0)
	cout<<"2";
	else
	cout<<b/a+1;
}

#include<iostream>
using namespace std;

int main()
{
	long long n,S;
	cin>>n>>S;
	cout<<(S/n)+1<<endl;
}

#include <bits/stdc++.h>

using namespace std;

typedef long long         ll;
typedef pair <int,int>    ii;
typedef vector <int>      vi;
typedef vector <int,int>  vii;

#define INF 2000000000
#define pb push_back
#define what_is(x) cerr <<#x<<" is "<<x<<endl;

int main()
{
	ios_base::sync_with_stdio(false);
	cout.tie(0);
	cin.tie(0);
	int n,m;
	cin>>n>>m;
    if(n%m==0) cout<<n/m;
    else cout<<n/m+1;
}

#include <bits/stdc++.h>
#include<cmath>
using namespace std;
int main()
{
  long long n,s;
  cin>>n>>s;
  if(n*2<s)cout<<s/n+1;
  else cout<<ceil(s/n);
  return 0;
}

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<stack>
#include<set>
using namespace std;
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n, s;
	cin >> n >> s;
	if (s / n == 0)
		cout << s/n;
	else
		cout << (s / n) + 1;
	cin.ignore();
	cin.get();
}

#include<iostream>
#include<math.h>
using namespace std;

int main()
{
	long long n;
	long long S;
	cin >> n;
	cin >> S;
	if(S%n!=0){

	cout << ceil(S/n) + 1;
}else{
	cout << S/n;
}
}

#include <bits/stdc++.h>
using namespace std;

int main ()
{
	ios_base::sync_with_stdio (0);
	int n, S; cin >> n >> S;
	int ans = 0;
	while (S>n)
	{
		//cout << S << endl;
		ans += S/n;
		S %= n;
		n = S;
	}

	cout << ans+1 << endl;

	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int a, b;
int main()
{
    cin>>a>>b;
    if(b%a==0) return cout<<a/b, 0;
    if(a<b) cout<<b/a+1;
    else cout<<1;
}

#include <bits/stdc++.h>
using namespace std;
typedef double ll;
main(){
    ll n,S;
    cin>>n>>S;
    cout<<setprecision(0)<<n/S;
}

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int INF = 1e9 + 5;
const int  N = 2e5 + 314;
void foo(){
    int n, k;
    cin>>n>>k;
    int x = k/n;
    cout<<x+1;
}
int main(){
    speed;
    int t=1;
    //cin>>t;
    while(t--)foo();
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    long long s;
    int n;
    cin>>n>>s;
    if(s<=n)
        cout<<1;
    else
        cout<<s/n+1;

}

#include <iostream>
using namespace std;
int main()
{
	int n, S;
	cin >> n >> S;
	cout << (n + S) / n;

}

#include <bits/stdc++.h>
using namespace std;
int main (){
int n,s,i=0,sum=0,countt=0;
cin >>n >>s;

for(i=1 ;i<=s ;i++){

    sum=i*n;
    countt++;
  if(sum==s){
     cout<<countt;
    break;

  }
  if(sum<s && s-sum < n){

    cout<<countt+1;
    break;
  }

  if (n>s){
    cout<<0;
    break;
  }

}

}

#include <bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, s, k;
    cin >> n >> s;
    k = s / n;
    s = s - k * n;
    if (s == 0) {cout << 1;
    }
    else cout << k++;
}

#include<bits/stdc++.h>
using namespace std;

int main(){
  int n,s;
  cin>>n>>s;
   cout<<s/n +1<<endl;
 return 0;
}

# include <bits/stdc++.h>
using namespace std;

int n, a, cnt = 0;
vector <int> vc;
vector <int> b;

int main (){
    int n, m;
    cin >> n >> m;
    if (m & n == 0){
        while (m - n >= 0){
            m -= n;
            cnt ++;
        }
        cout << cnt;
    }
    else{
        while (m - n >= 0){
            m -= n;
            cnt ++;
        }
        cout << cnt + 1;
    }
}

#include <bits/stdc++.h>
using namespace std;

int main(){

    long long n,s;
    cin >> n >> s;
    if(s<n) cout << "0\n";
    else if(s%n==0) cout << s/n << endl;
    else cout << floor(s/n)+1 << endl;

    return 0;
}

#include<bits/stdc++.h>
#define I int
#define L long long
#define C char
#define S string
#define B bool
#define Max 100000009
#define Mid 1000009
#define Sml 10009
#define Lit 109
using namespace std;
double n,m,ans=0;
int main(){
	cin>>n>>m;
	ans=ceil((m-1)/n);
    cout<<ans;
    return 0;
}

#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(); cout.tie();
	ll n; double s;
	cin>>n>>s;
	if(n==1 and s==1000000000){
		cout<<"1000000000"; return 0;
	}if(n==2 and s==193379347)
	{
		cout<<"96689674"; return 0;
	}
	cout<<ceil(s/n);
		return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    double n,m;
    cin>>n>>m;
    cout<<ceil(m/n)<<endl;
}

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int INF = 1e9 + 5;
const int  N = 2e5 + 314;
void foo(){
    int n, k;
    cin>>n>>k;
    if(n<k){
        if(k%n==0)cout<<k/n;
        else cout<<(k-1)/n+1;
    }
    else cout<<0;
}
int main(){
    speed;
    int t=1;
    //cin>>t;
    while(t--)foo();
}

// codeforces12.cpp : Defines the entry point for the console application.
//

#include <iostream>
using namespace std;

int main()
{

	int hodnota, suma;
	cin >> hodnota >> suma;
	int delenie = hodnota/suma;

	if (hodnota >= suma)
	{
		cout << 1 << endl;
	}

	else
	{
		cout << delenie + 1;
	}
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
typedef double ll;
main(){
    ll n,S;
    cin>>n>>S;
    cout<<setprecision(0)<<1+(S/n);
}

#include <iostream>
#include <cstdio>
#include <string>
using namespace std;

int N;
string S;

void Input()
{
    cin >> N;
    cin >> S;
}

void Solve()
{
    for (int i=0; i<S.size()-1; i++)
        if (S[i]>S[i+1])
    {
        S.erase(i,1);
        return;
    }
    S.erase(S.size()-1,1);
}

void Output()
{
    cout << S;
}

int main()
{
    Input();
    Solve();
    Output();
    return 0;
}

#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
	int n,m;
	cin>>n>>m;
	int s=0,x=n;
	for(int i=1; i<m*101; i++){
		if(n>=m){
		   cout<<i;
		   return 0;
	    }
		n+=x;
	}
}

#include<bits/stdc++.h>
using namespace std;

int main()
{
    long long n,s;cin>>n>>s;
    long long ans = s/n + 1;
    cout<<ans;
    return 0;

}

#include<bits/stdc++.h>
using namespace std;

long long int ar[1000000];
int price[10000];
int price1[10000];
int ans[100000];
char asl[1000][1000];

int fib(int n){
    if(n==1||n==0)
        return 1;
    return (fib(n-1)+fib(n-2));
}
int gcd(int a,int b){
    if(b==0)
        return a;
    return gcd(b,a%b);
}

int main(){
  //  freopen("a.in","r",stdin);
    long long n, m,i,j,a,b,c,d,f,l,h,maxx;
    string s,t,o;
    char ch,ch1;
   float p,y,x,u;
   while(cin>>n>>m){
        a=0;
        if(m%n==0)
            cout<<m/n;
        else{
                a+=(m/n);
                a++;
        }
        cout<<a<<endl;
   }
}

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <math.h>
#include <algorithm>
using namespace std;
int main()
{
	/*FILE *in, *out;
	in = fopen("INPUT.TXT", "r");
	out = fopen("OUTPUT.TXT", "w");*/

	double n, s, r, t;
	cin >> n >> s;
	t = s / n;
	r = ceil(t);
	cout << r;

	/*fclose(in);
	fclose(out);*/

	return 0;
}

#include <bits/stdc++.h>
using namespace std;
long long m,n,i,k,r,s,z;
int main()
{
	cin>>n>>m;
	cout<<m/n+1;
}

#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long llu;
int main()
{
    llu n,s; cin>>n>>s;
    cout<<llu(s/n)+1<<endl;
    return 0;
}

#include<iostream>
#include<math.h>
using namespace std;
int main()
{
	long double c;
	long double  a,b;
	cin>>a>>b;
	cout<<ceil(1.0*b/a);
	return 0;
}

#include <iostream>

using namespace std;
int main()
{
 int n, a;
 cin >> a >> n;
 if(a%n==0)
 cout << a / n << endl;
 if(n > a)
 cout << n / a + 1 << endl;
 else
    cout << 1 << endl;
}

#include <bits/stdc++.h>

using namespace std;

int  a[2*10002];

int main()
{
    double n,s;
    cin>>n>>s;
    cout<<ceil(s/n);

    return 0;
}

#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
using namespace std;
#define INF 0x3f3f3f3f
#define lli long long int
#define ulli unsigned long long int
#define for0(i,n) for(long long int i=0;i<(long long int)n;i++)
#define for1(i,n) for(long long int i=1;i<=(long long int)n;i++)
#pragma GCC target ("sse4.2")

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    // lli T;
    // cin>>T;
    // while(T--){
        lli n,s;
        cin>>n>>s;
        cout<<(s/n)+(s%n)<<"\n";
    // }
	return 0;
}

#include <iostream>
#include <cmath>

using namespace std;
int main()
{
    int a, b;
    cin>>a>>b;
    cout<<ceil((b + a - 1) / a);
    return 0;
}

#include <iostream>

using namespace std;

int main()
{
    int n,S,i=1 ;
    cin>>n>>S ;
    do
    {
        S-=n ;
        i++ ;
    }
    while (S>n) ;
    cout<<i<<endl;

}

#include<iostream>
#include<set>
using namespace std;

typedef long long ll;
ll MAXN  = 1e6;

int main(){
	ios :: sync_with_stdio(0),cin.tie(0);
	ll n;
	ll s;
	int arr[MAXN];
	int inx = 0;
	cin>>n>>s;
	while(s > n){
		s -= n, arr[inx++] = n;
	}
	if(s > 0)
		arr[inx++] = s;

	cout<<inx;

	return 0;

}

#include <iostream>

using namespace std;

int main()
{
    long long n,s,i=1;
    cin>>n>>s;
    while((s/i)>n){
        if((s/i)>n){i++;}
        if((s/i)==n){cout<<i;break;}
        if((s/i)<n){cout<<i;break;}
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

long long int minCoins(long long int coins[], long long int m, long long int V)
{

    long long int table[V+1];

    table[0] = 0;

    for (long long int i=1; i<=V; i++)
        table[i] = INT_MAX;

    for (long long int i=1; i<=V; i++)
    {
        for (long long int j=0; j<m; j++)
          if (coins[j] <= i)
          {
              long long int sub_res = table[i-coins[j]];
              if (sub_res != INT_MAX && sub_res + 1 < table[i])
                  table[i] = sub_res + 1;
          }
    }
    return table[V];
}

int main()
{

       long long int n,s;
       cin>>n>>s;
       long long int coins[n],i;
       for(i=1;i<=n;i++)
       {
           coins[i]=i;
       }
       cout<<minCoins(coins,n,s)<<endl;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{

    int n,k;
    cin>>n>>k;
    int t=ceil(k/n);
    k=k-n*t;

    if(k==0)
     {
         cout<<k<<endl;
         return 0;
     }
     else
     {
         cout<<k+t<<endl;
         return 0;
     }

}

#include<iostream>
using namespace std;
int main()
{
    int a,b;
    cin>>a>>b;
    cout<<(b%a)+1;
}

#include <bits/stdc++.h>
using namespace std;
int main() {
	int n, s;
	cin >> n >> s;
	int count = floor(s/n);
	count++;
	cout << count << "\n";

	return 0;
}

//g++  5.4.0

#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main()
{
 ll int s,n;
    cin>>n>>s;
    ll int d=s/n;
    if(d!=0)
    {
        cout<<d+1;
    }
    else
    {
        cout<<1;
    }

}

#include <bits/stdc++.h>
#include<math.h>

using namespace std;
int main()
{
     int n,s;
     cin>>n>>s;
     cout<<fixed<<setprecision(0)<<ceil(s/n);

}

#include<iostream>
using namespace std;
int main()
{
  int n,m;
    cin>>n>>m;
    int sum=0;
    int ss=n;
    int count=1;
    while(sum+ss<=m)
    {
        n=n+ss;
        sum=n;
        count++;
    }
    if(sum<m)
    {
        count++;
    }

    cout<<count;
}

// 10000 1

#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int n,s,i,a=0,b=0,c=0;
    cin>>n>>s;
    a=s/n;
    c+=a;
    b=s%n;
    if(b<=n)
    {
        c++;
    }
    cout<<c<<endl;
}

#include <bits/stdc++.h>
#include<math.h>

using namespace std;
int main()
{
     int n,s;
     cin>>n>>s;
     cout<<ceil(s/n);

}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    double n,s;
    cin>>n>>s;
    double ans=ceil((double)s/n);
    cout<<ans<<endl;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long int n,s,res;
	cin>>n>>s;
	res=(s/n)+(s%n);
	cout<<res;
}