A tech company is benchmarking their algorithm's performance using different hardware. They have tasked you with finding the fastest time in which they can get the algorithm to run, out of a list of all the different run times they have achieved.

Input

The first line contains an integer, ~n~ ~(n \geq 1)~. The following line then contains ~n~ space seprated unique integers ~x_i~ ~(1 \leq x_i \leq 10^5)~. These represent the run times of the algorithm.

Output

Print the fastest of all the run times.

Examples

Input

5  
3 5 8 7 20

Output

3

Input

2  
6 10

Output

6