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 Rust (1.15.1) (judge verdict: Accepted)

fn main(){
	let mut s = String::new();
	std::io::stdin().read_line(&mut s).unwrap();
	let n: usize = s.trim().parse().unwrap();
	let mut max = -1;
	let mut min = 10;
	let mut s = String::new();
	std::io::stdin().read_line(&mut s).unwrap();
	let v: Vec<&str> = s.trim().split(' ').collect();
	for i in 0..n {
		let n = v[i].parse().unwrap();
		if i == 0 {
			max = n;
			min = n;
		} else {
			if n > max {
				max = n;
			}
			if n < min {
				min = n;
			}
		}
	}
	println!("{}", if max - min > 0 {
		max - min
	} else {
		(max - min) * - 1
	});
}