Pipes

문제

[이미지 1]Valter is a fan of experiments. His latest experiment is depicted in the figure: he rolls several pipes down an inclined floor until they are stopped either by the wall perpendicular to the floor or by another pipe rolled earlier; after all the pipes have stopped, Valter measures the distance from the wall to the farthest point of the farthest pipe.

Now his classmate Vanessa pointed out that some pipes may have no impact on the result. For example, in the figure, neither pipe 1 nor pipe 3 impact the positions of the following pipes. In addition, the farthest point may be in a pipe that was not rolled last.

Write a program that gets the radii of the pipes and computes the distance from the wall to the farthest point among all the pipes.

입력

The first line contains $NN$ ($1\le N\le {10}^{5}1\; \backslash le\; N\; \backslash le\; 10^5$), the number of pipes. Each of the following $NN$ lines contains one real number, the radii $R_{i}R\_i$ () of the pipes, in the order in which the pipes are rolled. Each radius is given with at most two digits after the decimal point.

출력

Output a single real number: the distance from the wall to the farthest point among all the pipes. The answer $xx$ will be accepted if , where $x^{\mathrm{\prime }}x\text{'}$ is the jury's answer.