#!/bin/python
import sys

def sort(array):
    less = []
    equal = []
    greater = []

    if len(array) > 1:
        pivot = array[0]
        for x in array:
            if x < pivot:
                less.append(x)
            if x == pivot:
                equal.append(x)
            if x > pivot:
                greater.append(x)
        return sort(less)+equal+sort(greater)
    else:  
        return array

def minimum(n,array):
    array = sort(array)
    min_ = abs(array[0]-array[1])
    
    for i in range(1,n-1):
            dif = abs(array[i]-array[i+1])
            if (dif < min_):
                min_ = dif
            if (min_ == 0):
                break         
           
    print min_    


n = int(raw_input().strip())
a = map(int, raw_input().strip().split(' '))
# your code goes here
minimum(n,a)