Journey

The planet J-Pax is described as a rectangular parallelepiped with dimensions: length A, width B, and height C. A resident living at the top corner of this shape decides to embark on a journey to the farthest point on the planet's surface.

Determine the shortest distance they must travel to reach this point.

Input

The input consists of a single line containing three integers: A, B, and C.

Output

Output a single real number representing the distance, ensuring that the absolute or relative error does not exceed 10^{-8}.

Constraints

1 ≤ A, B, C ≤ 1000

Examples