eolymp
bolt
Try our new interface for solving problems
Problems

Two biggest

Two biggest

Time limit 1 second
Memory limit 128 MiB

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

Input data

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

Output data

Print the sum of two biggest elements in array.

Examples

Input example #1
5
1 5 2 6 3
Output example #1
11
Input example #12
5
-1 -2 -3 -4 -5
Output example #12
-3