e-olymp
Problems

Two biggest

Two biggest

Array of n integers is given. Find the sum of two biggest elements in array.

Input

First line contains number n (n100). Next line contains n integers, each of them is no more than 100 by absolute value.

Output

Print the sum of two biggest elements in array.

Time limit 1 second
Memory limit 128 MiB
Input example #1
5
1 5 2 6 3
Output example #1
11