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 Pascal (FPC 2.6.2) (judge verdict: Wrong Answer)

uses
  SysUtils,
  Classes;

var
	a, i, j, t : Integer;
	atype : array of Integer;
	str : String;
	strlist : TStringList;
begin
	readln(a);
	setLength(atype, a);
	
	readln(str);
	strlist := TStringList.Create;
	try
		strlist.Delimiter := ' ';
		strlist.DelimitedText := str;
		for i := 0 to a - 1 do
			atype[i] := strToInt(strlist.Strings[i]);
	finally
		strlist.free;
		end;
		
	for i := 1 to a - 2 do
		begin
		for j := a - 2 downto i do
			begin
				if atype[j - 1] > atype[j] then
					begin
					t := atype[j - 1];
					atype[j - 1] := atype[j];
					atype[j] := t;
					end;
			end;
		end;
		t := atype[a -1] - atype[0];
		writeLn(t);
end.