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 Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		long[] a = new long[n];
		for (int i = 0; i < n; i++) {
			a[i] = scan.nextInt();
		}
		long max = 0;
		int m = 1;
		for (int i = 1; i < n; i++) {
			m = m*i;
		}
		long[] abs = new long[m];
		int o = 0;
		for (int i = 0; i < n-1; i++) {
			for (int j = i+1; j < n; j++) {
					abs[o] = Math.abs(a[i] -a[j]);
					o++;
			}
		}
		for (int i = 0; i < m; i++) {
			if (abs[i] > max) {
				max = abs[i];
			}
		}
		System.out.println(max);
	}
}