Problem: While sailing on a boat, Inessa noticed a beautiful water lily flower above the lake's surface. She came closer and it turned out that the lily was exactly H centimeters above the water surface. Inessa grabbed the flower and sailed the distance of L centimeters. Exactly at this point the flower touched the water surface.

<image>

Suppose that the lily grows at some point A on the lake bottom, and its stem is always a straight segment with one endpoint at point A. Also suppose that initially the flower was exactly above the point A, i.e. its stem was vertical. Can you determine the depth of the lake at point A?

Input

The only line contains two integers H and L (1 ≤ H < L ≤ 10^{6}).

Output

Print a single number — the depth of the lake at point A. The absolute or relative error should not exceed 10^{-6}.

Formally, let your answer be A, and the jury's answer be B. Your answer is accepted if and only if \frac{|A - B|}{max{(1, |B|)}} ≤ 10^{-6}.

Examples

Input


1 2


Output


1.5000000000000


Input


3 5


Output


2.6666666666667

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int modulo = (119 << 23) + 1;
const int maxn = 3e5 + 1;
int test() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  double h, l;
  cin >> h >> l;
  double ans = (h * h - l * l) / (-2 * h);
  cout << setprecision(8) << ans;
  return 0;
}
int solve(int tmp[], int a, int b, int n) {
  int cnt = 0;
  int div = tmp[b] - tmp[a];
  int now = 2;
  for (int i = b + 1; i < n; i++) {
    if (tmp[i] == tmp[a] + div * now) {
      cnt++, now++;
    }
  }
  return cnt;
}
static int search(int num, int b[], int n) {
  for (int i = 0; i < n; i++) {
    if (b[i] == num) {
      i + 1;
      return 0;
    }
  }
  return 1;
}
int donot() { return 0; }
int hack() { return 1; }
string me() {
  const char* s = "do not hack me";
  return s;
}
class havenoidea {
  int ameaninglessnum = 49935;
  bool iamanaduit = 1;

 public:
  int iwillsolvefiveproblems(int x) { return x; }
};
int main() {
  if (hack()) donot();
  int tmp[6] = {1, 1, 4, 5, 1, 4};
  solve(tmp, search(114514, tmp, 6), 1, 6);
  int a, b, c, d;
  havenoidea fuck;
  fuck.iwillsolvefiveproblems(hack());
  test();
  if (me() == "do not fack me")
    if (me() == "do not hack me") hack() == donot();
  return 0;
}