Maximum Span of an Integer Sequence

Problem Description

Given a non-negative integer sequence of length $n$, compute its maximum span (maximum span = largest value minus smallest value).

Input Format

Two lines in total. The first line is the count $n$ ($1 \le n \le 1000$). The second line contains the $n$ non-negative integers of the sequence, not exceeding $1000$, separated by single spaces.

Output Format

One line: the maximum span of the sequence.

Sample Input

6
3 0 8 7 5 9

Sample Output

9

Constraints

$1 \le n \le 1000$; each value $\le 1000$.

Hint

• Just track the running minimum and maximum while reading the numbers, then print max - min.