Dima and the Computer Game#2933
Dima is playing a computer game in which, on one level, he drives a car through a section of road that features a 90° turn.
More precisely, this section of road consists of two roads intersecting at a right angle, as shown in the figure:
The car can move at any moment either in a straight line or along a circular arc, with its direction changing continuously.
Find a path on the road from a point far to the left to a point far below. Define the turning radius of a path as the smallest radius among all circular arcs along the path. What is the largest possible turning radius with which Dima can navigate this section of road?
The only line contains two integers w_1 and w_2 (1 \leq w_1, w_2 \leq 100) — the widths of the left and bottom parts of the road, respectively.
Output a single number — the maximum turning radius. The answer will be accepted if its relative error does not exceed 1e-9.
Example 1