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 JAVA):

Solution:
	import java.io.BufferedReader;
	import java.io.IOException;
	import java.io.InputStreamReader;
	import java.io.PrintWriter;
	import java.util.ArrayList;
	import java.util.Arrays;
	import java.util.Collections;
	import java.util.HashMap;
	import java.util.HashSet;
	import java.util.PriorityQueue;
	import java.util.Scanner;
	import java.util.StringTokenizer;
	
	import javax.management.Query;
	
	public class Main {
	
		static boolean[] isPrime;
		static ArrayList<Integer> primes;
		static int[] pri;
	
		static void sieve(int N) {
			isPrime = new boolean[N + 1];
			Arrays.fill(isPrime, true);
			isPrime[0] = false;
			isPrime[1] = false;
			for (int i = 2; i * i <= N; i++) {
				if (isPrime[i]) {
					for (int j = i * i; j <= N; j += i) {
						isPrime[j] = false;
					}
				}
			}
			for (int i = 2; i < isPrime.length; i++) {
				if (isPrime[i])
					primes.add(i);
			}
			pri = new int[primes.size()];
			for (int i = 0; i < pri.length; i++) {
				pri[i] = primes.get(i);
			}
		}
	
		static int help(int n) {
			int k = n;
			int c = 0;
			if (isPrime[n])
				return 1;
			else {
				for (int i = 0; i < primes.size() && pri[i] * pri[i] <= k; i++) {
					int p = pri[i];
					if (n % p == 0) {
						c = 1 + cum[n / p] - cum[n / p - 1];
					}
				}
				return c;
			}
		}
	
		// static void printPFsInPairs(int n) {
		// int k = n;
		// for (int i = 0; i < primes.size() && primes.get(i) <= k; i++) {
		// int p = primes.get(i);
		// int c = 0;
		// while (k % p == 0) {
		// k /= p;
		// c++;
		// }
		// if (c != 0) {
		// r.add(p);
		// r.add(c);
		// }
		// }
		// if (k != 1) {
		// r.add(k);
		// r.add(1);
		// }
		// }
		static long power(long x, int y) {
			if (y == 0)
				return 1;
			else {
				long b = power(x, y / 2);
				if (y % 2 == 0)
					return b * b;
				else
					return b * b * x;
			}
		}
	
		static int printPFsInPairs(int n) {
			int c = 0;
			for (int i = 0; i < pri.length && pri[i] <= n; i++) {
				int p = pri[i];
				for (int j = 1; power(p, j) <= n; j++) {
					c += n / power(p, j);
				}
			}
			return c;
		}
	
		static int[] cum;
	
		public static void main(String[] args) throws IOException, InterruptedException {
			Scanner sc = new Scanner(System.in);
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			PrintWriter pw = new PrintWriter(System.out);
			
			double h=sc.nextDouble();
			double l=sc.nextDouble();
			double x=(l*l-h*h)/(2*h);
			System.out.println(x);
			pw.flush();
	
		}
	}