A. Cask Effect
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

As is widely known, Chinese children are all aware of the famous cask effect: the capability of a cask depends on the length of the shortest board of it.

Mandy gets $$$n$$$ boards. She decides to give them to Brz to make a cask since Brz is an expert in this field. Knowing the cask effect well, to make its capability as large as possible, Brz makes up his mind to use the magic he can use only once in his life to transfer a section of one board to another.

For instance, assume that there are two boards with lengths $$$6$$$ and $$$14$$$. He can transfer a section of length $$$2.33$$$ from the board with length $$$6$$$ to the other board. After that their lengths will become $$$3.67$$$ and $$$16.33$$$ respectively.

Since Brz is only skilled at practice, he turns to you for the theoretical part. He wants to know what is the maximal capability of the cask he can make with his magic. Can you tell him the answer?

Input

The first line contains one integer $$$n$$$ $$$(1\leq n\leq 10^5)$$$, denoting the number of boards that Mandy gives Brz.

The second line contains $$$n$$$ integers. The $$$i$$$-th integer $$$a_i$$$ $$$(1\leq a_i\leq 10^9)$$$ denotes the length of the $$$i$$$-th board.

Output

Output one line containing one real number, denoting the maximal capability of the cask. Round the answer to exactly one decimal place.

Example
Input
3
1 2 3
Output
2.0