They say that planet J-Pax has the shape of a rectangular parallelepiped with length , width , and height . A person living at the very top corner decides to travel. They choose as their destination the point on the surface of the planet that is farthest along the surface.
Find the shortest distance they must travel to reach this point.
The input consists of a single line containing three integers , , .
Output a single real number—the distance—such that the absolute or relative error does not exceed 10^{-8}.
Constraints
1 \leq A, B, C \leq 1000
Example 1