#include <bits/stdc++.h>
using namespace std;
int main() {
  double h, r;
  int ans, n, tmp;
  scanf("%lf %lf", &r, &h);
  ans = floor((h - r / 2) / r) * 2 + 2;
  tmp = floor((h + r - sqrt(3) / 2 * r) / r) * 2 + 1;
  ans = max(ans, tmp);
  n = floor((h - sqrt(3) / 2 * r) / (sqrt(3) / 2 * r));
  if (n > 0) ans = max(ans, 2 + n / 2 * 3 + n % 2 + 1);
  n = floor((h - r / 2) / (sqrt(3) / 2 * r));
  if (n > 0) ans = max(ans, 2 + n / 2 * 3 + n % 2);
  printf("%d\n", ans);
  return 0;
}
