#include<stdio.h>
#include<stdlib.h>




int sortfnc(const void *a,const void *b){

	if(*(long*)a == *(long*)b){
	return 0;
	}

	if(*(long*)a < *(long*)b)
	{return -1;
	}

	return 1;

}


int main(void)
{

long int n,x[100000],i,c=1000001;

scanf("%ld",&n);

for(i=0;i<n;i++){
	scanf("%ld",&x[i]);
}
	qsort(x, n, sizeof(int), sortfnc);

if(n==1 || n==0){
	c=0;
}

for(i=0;i<n-1;i++){
	if( x[i] != x[i+1] && x[i+1]-x[i]<c){
		c=x[i+1]-x[i];
	}
	
}
if(c==1000001){
	c=0;
}

printf("%ld\n",c);





return 0;

}