<Problem>
http://ntucoder.net/Problem/Details/39
USES CRT,MATH;
type Arr=array[1..1000000] of longint;
var n,mis,t,i,res:longint;
a:Arr;
PROCEDURE SORT (var a:Arr; l,r:longint);
var x,tg,i,j:longint;
begin
i:=l;
j:=r;
x:=a[(l+r) div 2];
repeat
while a[i]<x do inc(i);
while a[j]>x do dec(j);
if not (i>j) then begin
t:=a[i];
a[i]:=a[j];
a[j]:=t;
inc(i);
dec(j);
end;
until i>j;
if l<j then SORT(a,l,j);
if i<r then SORT(a,i,r);
end;
begin
readln(n);
for i:=1 to n do read(a[i]);
SORT(a,1,n);
res:=999999999;
for i:=2 to n do res:=min(res,a[i]-a[i-1]);
writeln(res);
readln
end.