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)

use std::cmp;

fn main() {
    let mut n_1 = String::new();
    std::io::stdin().read_line(&mut n_1).unwrap();
    let _n: i32 = n_1.trim().parse().unwrap();
    
    let mut a_numbers = String::new();
    std::io::stdin().read_line(&mut a_numbers).unwrap();
    let a_vec: Vec<i32> = a_numbers.trim().split_whitespace()
        .map(|x| x.parse().unwrap()).collect();
    
    let mut small: i32 = 1000000001;
    let mut big: i32 = 0;

    for a in a_vec {
        small = cmp::min(small, a);
        big = cmp::max(big, a);
    }
    
    println!("{}", big - small);
}