#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n, i;
cin >> n;
int *X = new int [n];
int minval = 10000;
for(i = 0; i<n; i++)
{
cin >> X[i];
}
sort(X, X+n); //sort(arr, arr+SIZE);默认升序
i = 1;
while(i < n)
{
minval = min(minval, X[i]-X[i-1]);
if (minval == 0)
break;
i++;
}
cout << minval<<endl;
delete X;
return 0;
}