3-sum

• Time limit: 1.00 s
• Memory limit: 512 MB

You are given an array of $n$ distinct integers. Your task is to select three of them such that their sum is maximal.

Input
The input consists of two lines. The first line has a single integer, $n$, the size of the array. The second line has exactly $n$ integers separated by spaces denoting the array.

Output
Output a single line containing the elements of the array that produce the maximal output. You may print the numbers in any order.

Constraints

• $ 3 \le n \le 100$
  
• All elements in the array are in the range $[-1000, 1000]$
  

Example

Input:
9
7 11 3 31 25 10 50 38 17

Output:
50 31 38