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 Python (3.8.2) (judge verdict: Accepted)

import sys
N = int(input())
array_A = list(map(int,input().split()))

if not (2 <= N <= 100):
    sys.exit()
for I in range(len(array_A)):
    if not (1 <= array_A[I] <= 10 ** 9):
        sys.exit()

print(max(array_A) - min(array_A))