package P135; import java.io.*; import java.util.Arrays; import java.util.Scanner; public class P135 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String n = sc.nextLine(); int nint = Integer.parseInt(n); String l = sc.nextLine(); String[] lstrs = l.split(" "); int lint[] = new int[nint]; int i = 0; int cmax = nint - 1; for (i=0;i<=cmax;i++) { lint[i] = Integer.parseInt(lstrs[i]); } int j = 0; int temp = 0; int ans = 1000000; int max = 0; int min = 1000000; // Arrays.sort(lint); for (i=0; ii; j--) { if (lint[j-1] > lint[j] ) { temp = lint[j-1]; lint[j-1] = lint[j]; lint[j] = temp; } } } temp = 0; for (i=1;i<=cmax;i++) { temp = Math.abs(lint[i-1] - lint[i]); if (ans > temp && lint[i] != lint[i-1]) { ans = temp; } if (max < temp){ max = temp; } if (min > temp) { min = temp; } } if (max == min) { ans = 0; } System.out.println(ans); } }