Bookend Minimum Width Sum

You are given a shelf with n books. Each book has a certain width. The books are arranged in order and are enclosed by two bookends. Your task is to find the smallest width from the list of books.

Formally, if the widths of the books are given as \(w_1, w_2, \dots, w_n\), you need to compute:

\(\min_{1 \leq i \leq n} w_i\)

If there is only one book, simply output its width.

inputFormat

The input is read from standard input (stdin) and is structured as follows:

• The first line contains an integer n, representing the number of books.
• The second line contains n space-separated integers representing the widths of the books.

outputFormat

Output a single integer to standard output (stdout) which is the minimum width among the given books.

## sample

1
12

12

</p>