Problem:
Score : 200 points

Problem Statement

It is only six months until Christmas, and AtCoDeer the reindeer is now planning his travel to deliver gifts.

There are N houses along TopCoDeer street. The i-th house is located at coordinate a_i. He has decided to deliver gifts to all these houses.

Find the minimum distance to be traveled when AtCoDeer can start and end his travel at any positions.

Constraints

1 ≤ N ≤ 100

0 ≤ a_i ≤ 1000

a_i is an integer.

Input

Input is given from Standard Input in the following format:

N
a_1 a_2 ... a_N

Output

Print the minimum distance to be traveled.

Sample Input 1

4
2 3 7 9

Sample Output 1

7

The travel distance of 7 can be achieved by starting at coordinate 9 and traveling straight to coordinate 2.

It is not possible to do with a travel distance of less than 7, and thus 7 is the minimum distance to be traveled.

Sample Input 2

8
3 1 4 1 5 9 2 6

Sample Output 2

8

There may be more than one house at a position.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.BufferedReader;
import java.io.InputStreamReader;

class Main {
    public static void main(String args[]) {
        int N, a[];
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            String buf = br.readLine();
            N = Integer.parseInt(buf);
            a = new  int[N];
            br = new BufferedReader(new InputStreamReader(System.in));
            buf = br.readLine();
            String coord[] = buf.split(" ");
            int min = 1001, max = -1;
            for (int i = 0; i < N; i++) {
                a[i] = Integer.parseInt(coord[i]);
                if (a[i] < min) min = a[i];
                if (max < a[i]) max = a[i];
            }
            System.out.println(max - min);
        } catch (Exception e) {
            System.err.println("Exception: " + e);
        }
    }
}