object Solution {
    
    def getPivot(a: Array[Int], low: Int, high: Int): Int = {
        var pivot = low
        var l = low
        var h = high
        /*println("In getPivot() low: " + low + " high: " + high)    
        for(i <- l to h){
            print(a(i) + " ")
        }    
        println()*/
        while(l < h){
            while(a(pivot) >= a(l) && l < high){
                l = l + 1
            }
            while(a(pivot) < a(h) && h > low){
                h = h - 1
            }
            if(l < h){
                var temp = a(l)
                a(l) = a(h)
                a(h) = temp    
            }    
        } 
        //println("low: " + l + " high: " + h)
        var temp = a(pivot)
        a(pivot) = a(h)
        a(h) = temp
        /*a.foreach(i => print(i + " "))
        println()    */
        h    
    }

    def quickSort(arr: Array[Int], low: Int, high: Int): Array[Int]={
        if(low<high){
            //println("In qs: low is " + low + " high is: " + high)
            var a = arr
            var pivot = getPivot(a,low,high)
            //println("pivot: " + pivot)   
            a = quickSort(a,low,pivot-1)
            a = quickSort(a,pivot+1,high)    
            a    
        } else {
            arr
        }
    }
    
    def main(args: Array[String]) {
        val sc = new java.util.Scanner (System.in);
        var n = sc.nextInt();
        var a = new Array[Int](n);
        for(a_i <- 0 to n-1) {
           a(a_i) = sc.nextInt();
        }
        
        a = quickSort(a,0,n-1)
        var min = a(1) - a(0)    
        for(i <- 2 to n-1){
            if(a(i) - a(i-1) < min){
                min = a(i) - a(i-1)
            }
        }    
        println(min)
        //a.foreach(i => print(i + " "))
        //println()    
    }
}