import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    
    private static int absoluteDiff(int[] a){
        
  /*      //Brute force - O(n^2)
        int min = Integer.MAX_VALUE;
        
        for(int i=0; i<a.length-1; i++){
            for(int j=i+1; j<a.length; j++){
                min = min<Math.abs(a[i] - a[j]) ? min : Math.abs(a[i] - a[j]);
            }
        }
        return min;
        
        
        */
        
        // O(nLogn)
        Arrays.sort(a);
        int min = Integer.MAX_VALUE;
        
        for(int i=0; i<a.length-1; i++){
            min = min<Math.abs(a[i] - a[i+1]) ? min : Math.abs(a[i] - a[i+1]);
        }
        return min;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] a = new int[n];
        for(int a_i=0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        // your code goes here
        System.out.println(absoluteDiff(a));
    }
}