Problem:
Score : 200 points

Problem Statement

You are given an integer sequence A of length N.
Find the maximum absolute difference of two elements (with different indices) in A.

Constraints

2 \leq N \leq 100

1 \leq A_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the maximum absolute difference of two elements (with different indices) in A.

Sample Input 1

4
1 4 6 3

Sample Output 1

5

The maximum absolute difference of two elements is A_3-A_1=6-1=5.

Sample Input 2

2
1000000000 1

Sample Output 2

999999999

Sample Input 3

5
1 1 1 1 1

Sample Output 3

0

Solution in Ruby (2.3.3) (judge verdict: Accepted)

input = gets
N = (input.chomp).to_i
input = readlines
A = (input[0].split).map(&:to_i)
i = 1
max = A[0]
min = A[0]
while i < N
  if max < A[i] then
    max = A[i]
  end
  if A[i] < min then
    min = A[i]
  end 
  i += 1
end
p max -min