#include <bits/stdc++.h>

using namespace std;

void swap(int i,int j, vector<int> &a){
    int temp = a[i];
    a[i] = a[j];
    a[j] = temp;
}


void quicksort(vector<int> &arr, int left, int right){
    int min = (left+right)/2;

    int i = left;
    int j = right;
    int pivot = arr[min];

    while(left<j || i<right)
    {
        while(arr[i]<pivot)
        i++;
        while(arr[j]>pivot)
        j--;

        if(i<=j){
            swap(i,j,arr);
            i++;
            j--;
        }
        else{
            if(left<j)
                quicksort(arr, left, j);
            if(i<right)
                quicksort(arr,i,right);
            return;
        }
    }
}

int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    
    quicksort(a,0,n-1);
    
    long int min = 10e10;
    
    for(int i = 0; i < n-1; i++)
        {
            if(abs((long int)(a[i]-a[i+1])) < min)min=abs((long int)(a[i]-a[i+1]));
        
    }
    cout<<min;
    return 0;
}