#include<stdio.h>
#include<iostream>
#include<cmath>

using namespace std;

int a[100000];
int b[100000];



void merge(int low,int mid, int high){
    int l1,l2,i;

    for(l1=low,l2=mid+1,i=low;l1<=mid && l2<=high;i++){
        if(a[l1]<a[l2]){
            b[i] = a[l1++];
        }else
            b[i] = a[l2++];
    }

    while(l1<=mid){
        b[i++] = a[l1++];
    }

    while(l2<=high){
        b[i++] = a[l2++];
    }

    for(i=low;i<=high;i++){
        a[i]=b[i];
    }
}

void sort(int low,int high){
    int mid;
    if(low<high){
        mid = (low+high)/2;

        sort(low,mid);
        sort(mid+1,high);
        merge(low,mid,high);
    }else
        return;
}


int main(){
    long i;
    long num;
    int min;
    int diff;
    cin>>num;

    for(long j=0;j<num;j++){
        cin>>a[j];
    }

    sort(0,num-1);

    min = abs(a[0]-a[1]);
    diff = abs(a[0]-a[1]);
    for(i=0; i<num-1; i++){
        diff = abs(a[i]-a[i+1]);
        if(diff < min){
            min = diff;
        }
    }
    cout<<min;

    return 1;
}