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

int mmax(int a, int b) {
	int x = (a > b) ? a : b;
	return x;
}

int mmin(int a, int b) {
	int x = (a < b) ? a : b;
	return x;
}

int binary_search(int n, vector<int> v,int key) {
	int left=0, right=n;

	while (left < right) {
		int mid = (left + right) / 2;
		if (v[mid] == key) return mid;
		else if (v[mid] < key) {
			left = mid + 1;
		}
		else if (v[mid] > key) {
			right = mid - 1;
		}
	}
}

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