Problem Statement

vou are given an array $a$ of size n $.$ Every element of array will be the dight hrom $0$ to $9.$ You have to select two indexes of the array, such that they form the biggest two digit number.

Input Format

First line of input will be the size of array i$.$e$.n.$

Next $n$ lines will be elements of array.

Constraints

$)n({10}^5$

$)$

It is guaranteed that at least one digit will be greater than $0.$

Output Format

Output a string, which denotes the biggest two digit number.

Evaluation Parameters

Sample Input

$8$

$4$

$2$

$6$

$4$

$8$

$5$

$0$