#include <bits/stdc++.h>

using namespace std;
void quicksort(int* Array,int Left,int Right)
{
    int i=Left;
    int j=Right;
    int tmp;
    int pivot=Array[(Left+Right)/2];
    while(i<=j)
        {
        while(Array[i]<pivot)
            {
            i++;
        }
        while(Array[j]>pivot)
            {
            j--;
        }
        if(i<=j)
            {
            tmp=Array[i];
            Array[i]=Array[j];
            Array[j]=tmp;
            i++;
            j--;
        }
    }
    if(j>Left)
        {
        quicksort(Array,Left,j);
    }
    if(i<Right)
        {
        quicksort(Array,i,Right);
    }
}
int main(){
    int n;
    cin >> n;
    
    int a[n];
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
        
    }
    quicksort(a,0,n-1);
    int number=a[0]-a[1];
    if(number<0)
        {
        number=-number;
    }
    int diff;
    for(int i=0;i<n-1;i++)
        {
        diff=a[i]-a[i+1];

        if(diff<0)
            {
            diff=-diff;
        }
        if(number>diff)
        {
            number=diff;
           
        }
    }
    cout<<number;
    // your code goes here
    return 0;
}