Source

This problem is adapted from Long Long OJ. All rights reserved.

Problem Description

One day, the State of hjj dispatched $n$ aircraft to the State of lzh. However, the State of lzh has a laser cannon that can destroy all aircraft with a height not exceeding $x$ (where $x$ is the height setting of the laser cannon) in one shot. Given the heights of the $n$ aircraft, find the minimum height $x$ for the laser cannon to destroy all $n$ aircraft in one shot.

Input Format

Two lines.

The first line contains a positive integer $n$.

The second line contains $n$ positive integers $a_1 \sim a_n$.

Output Format

A single line containing a positive integer, representing the minimum height $x$ of the laser cannon.

Samples

6
1 1 4 5 1 4

5

Data Range

$1\le n \le 10^5$, $1\le a_i \le 10^9$.