Laid on the flat ground in the stockyard are a number of heavy metal cylinders with (possibly) different diameters but with the same length. Their ends are aligned and their axes are oriented to exactly the same direction.

We'd like to minimize the area occupied. The cylinders are too heavy to lift up, although rolling them is not too difficult. So, we decided to push the cylinders with two high walls from both sides.

Your task is to compute the minimum possible distance between the two walls when cylinders are squeezed as much as possible. Cylinders and walls may touch one another. They cannot be lifted up from the ground, and thus their order cannot be altered.

Figure B.1. Cylinders between two walls

The input consists of a single test case. The first line has an integer $N$ $(1 \leq N \leq 500)$, which is the number of cylinders. The second line has $N$ positive integers at most 10,000. They are the radii of cylinders from one side to the other.

Print the distance between the two walls when they fully squeeze up the cylinders. The number should not contain an error greater than 0.0001.

2 10 10

40.00000000

2 4 12

29.85640646

5 1 10 1 10 1

40.00000000

3 1 1 1

6.00000000

2 5000 10000

29142.13562373

The following figures correspond to the Sample 1, 2, and 3.

Source: ACM International Collegiate Programming Contest
, Asia Regional Tsukuba, Tsukuba, Japan, 2015-11-29

http://icpc.iisf.or.jp/2015-tsukuba/

http://icpc.iisf.or.jp/2015-tsukuba/