#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder; 
#endif
using namespace std; using ll = long long; using pa = pair<ll,ll>; using ld = long double;
using pq = priority_queue<pa, vector<pa>, greater<pa>>; //グラフ系で使える
#define all(a) a.begin(),a.end()  
#define rall(a) a.rbegin(),a.rend()
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl;
#define deb( x ) cerr << #x << " = " << ( x ) << endl
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;} template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
const int dy[4] = {0, 0, 1, -1}, dx[4] = {-1, 1, 0, 0}; const int ddy[8] = {-1, -1, -1, 0, 0, 1, 1, 1}, ddx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
long long INF = 1LL << 62, mod = 998244353;
//using mint = modint998244353; //問題で変える
#define int ll

//小数出力 = ldout, 入出力高速化 = forfast
//グリッドに抑える = grid
//素因数分解 = forprime, 素数列挙 = prime
//約数列挙 = divisor, nCr = ncr
//行列累乗など = matrix
//mo'sアルゴリズムのソート = mosort
//hash値(Zoblish) = forhash, Rolling Hash = roriha
//main内のlazy_segtree定義 それ単体 = makeseg
//lazysegの関数など (plus = 加算) + (min, max, sum), changemin, changemax
//lazyseg, 加算代入どちらもできるやつ = bothsum
//{初期値, false}を詰めた配列で初期化すること
//Segtree's monoids : https://blueberry1001.github.io/Blueberry-library/monoids.html
//Templetes : https://atcoder.jp/contests/abc318/submissions/80061677
//snippets(json) : https://atcoder.jp/contests/abc318/submissions/80067458
signed main(){
    int a, b;
    cin >> a >> b;
    cout << (b + a - 1) / a << endl;

}