Minimum Remaining Height

You are given a collection of boxes with positive integer heights. In one operation, you can perform an unspecified set of operations (which, as it turns out, reduces to simply selecting the minimum height when repeated arbitrarily). Formally, given a set of heights \( H = \{h_1, h_2, \ldots, h_n\} \), the answer is defined as:

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

Your task is to compute the minimum height among all boxes.

inputFormat

The input is given via standard input (stdin) in the following format:

• The first line contains an integer \( n \) (\(1 \leq n \leq 10^5\)) representing the number of boxes.
• The second line contains \( n \) space-separated positive integers \( h_1, h_2, \ldots, h_n \) where each \( h_i \) denotes the height of a box.

outputFormat

Output a single integer via standard output (stdout) representing the minimum height among the boxes.

5
9 1 2 6 5

1