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

//const fi='traveling.inp';
//      fo='traveling.out';
var n,s:longint;
    a:array[0..10000] of longint;
//procedure mo;
//begin
 //       assign(input,fi);
 //       reset(input);
 //       assign(output,fo);
 //       rewrite(output);
//end;

procedure nhap;
var i:longint;
begin
        readln(n);
        for i:=1 to n do
                read(a[i]);
end;

procedure swap(a,b:longint);
var c:longint;
begin
        c:=a;
        a:=b;
        b:=c;
end;

 procedure sort(l,r: longint);
      var
         i,j,x,y: longint;
      begin
         i:=l;
         j:=r;
         x:=a[(l+r) div 2];
         repeat
           while a[i]<x do
            inc(i);
           while x<a[j] do
            dec(j);
           if not(i>j) then
             begin
                y:=a[i];
                a[i]:=a[j];
                a[j]:=y;
                inc(i);
                j:=j-1;
             end;
         until i>j;
         if l<j then
           sort(l,j);
         if i<r then
           sort(i,r);
      end;

procedure xuly;
var i:longint;
begin
        for i:=2 to n do
                s:=s+a[i]-a[i-1];
        writeln(s); 
end;


begin
        //mo;
        nhap;
        sort(1,n);
        xuly;
end.