#!/bin/python3

import sys

def main():
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    QuickSort(a, 0, len(a)-1)
    i, minimum = 0, 0
    while(i < (n-1)):
        if i == 0:
            minimum = abs(a[i]-a[i+1])
        elif abs(a[i]-a[i+1]) < minimum:
            minimum = abs(a[i]-a[i+1])
        i = i + 1
    print(minimum)
# your code goes here

def QuickSort(array, start, end):
    if start > end or start < 0:
        return(array)
    pivot = PartitionArray(array, start, end)
    QuickSort(array, pivot+1, end)
    QuickSort(array, start, pivot-1)
def PartitionArray(array, start, end):
    pivot = start
    i = start+1
    for j in range(start+1, end+1):
        if array[j]<array[pivot]:
            array[j], array[i] = array[i], array[j]
            i = i + 1
    array[pivot], array[i-1] = array[i-1], array[pivot]
    return(i-1)
if __name__ == "__main__":
    main()