#include <iostream>
#include <vector>

using namespace std;

class QuickSort 
{
public:
		void quickSort(int a[], int p, int r)
        {
            if (p < r)
            {
                int q = partition(a, p, r);
				quickSort(a, p, q - 1);
                quickSort(a, q + 1, r);
            }
        }

        int partition(int a[], int p, int r)
        {
            int pivot = a[r];
            int i = p - 1;

            for (int j = p; j < r; j++)
            {
                if (a[j] < pivot)
                {
                    i = i + 1;
                    int temp = a[i];
                    a[i] = a[j];
                    a[j] = temp;
                }
            }

            int t = a[i + 1];
            a[i + 1] = a[r];
            a[r] = t;

            return i + 1;
        }
};

int findMinDiff(int a[], int n)
{
	int diff = 1000000;

	for(int i = 0; i < n - 1; i++)
	{
		if(abs(a[i + 1] - a[i]) < diff)
			diff = abs(a[i + 1] - a[i]);
	}

	return diff;
}

int main()
{
	//vector<int> a;
	int a[100000];
	int n;
	cin >> n;
	int num;
	for(int i = 0; i < n; i++)
	{
		cin >> a[i];
		//a.push_back(num);
	}
	QuickSort qs;
	qs.quickSort(a, 0, n - 1);

	int diff = findMinDiff(a, n);
	cout << diff << endl;

	return 0;
}