#include <bits/stdc++.h>
using namespace std;
bool is_sort(int ar[], int n) {
  for (int i = 0; i < n - 1; i++) {
    if (ar[i] > ar[i + 1]) return false;
  }
  return true;
}
int main() {
  long long int n, second;
  cin >> n >> second;
  if (n >= second) {
    cout << "1" << endl;
    return 0;
  }
  if (second % n == 0)
    cout << (second / n) << endl;
  else
    cout << (second / n) + 1 << endl;
}
