Олимпиадный тренинг

Задача 38711. Running to Steklyashkin


Задача

Темы: Цикл for
After the beetle flew into Dunno and hit him on the head, Dunno gathered N of the Flower City shorties around him and said, "And now, brothers, the sun broke a piece and flies straight to us. Soon it will fall and crush us all. Horror what will happen! Go ask Steklyashkin." All the little ones knew that Dunno was a talker, but nevertheless they decided to run faster to Steklyashkin and find out the truth. Steklyashkin lives on the same street, so the shorties had to run in one straight line. After 10 seconds, each shorty ran away from Dunno at a distance of a. Determine the maximum  the distance between any two shorts who ran to Steklyashkin. 

Input
The first line contains an integer N (1<=N<=100). The second line contains N numbers ai (1<=ai<=109 ) - the distance that the i-th shorty ran away from Dunno.

Imprint
Print the maximum  the distance between any two shorts who ran towards Steklyashkin.
 
Examples
# Input Output
1 4
1 4 6 3
5
2 5
1 1 1 1 1
0