import java.util.*;

public class minabsdiff {
	public static void main(String[] args) {
		Scanner kb = new Scanner(System.in);
		HashSet<Integer> lel = new HashSet<Integer>();
		PriorityQueue<Integer> nums = new PriorityQueue<Integer>();
		int l = kb.nextInt();
		for(int i = 0; i<l; i++)
			nums.add(kb.nextInt());
		int prev = Integer.MIN_VALUE;
		while(!nums.isEmpty()){
			if(prev == Integer.MIN_VALUE)
				prev = nums.poll();
			else{
				int t = nums.poll();
				lel.add(Math.abs(prev-t));
				prev = t;
			}
		}
		Object obj = Collections.min(lel);
		System.out.println(obj);
	}
}