content: import java.io.*;
  import java.math.*;
  import java.security.*;
  import java.text.*;
  import java.util.*;
  import java.util.concurrent.*;
  import java.util.regex.*;
  
  public class Solution {
  
      // Complete the minimumLoss function below.
      static int minimumLoss(long[] price) {
      HashMap<Long, Integer> index = new HashMap<>();
      for (int i = 0; i < price.length; i++) {
        index.put(price[i], i);
      }
  
      Arrays.sort(price);
      long min = Integer.MAX_VALUE;
      for (int i = 1; i < price.length; i++) {
        long diff = price[i] - price[i - 1];
        if (diff >= 0 && index.get(price[i]) < index.get(price[i - 1])) {
          min = Math.min(min, diff);
        }
      }
  
      return (int) min;
    }
  
      private static final Scanner scanner = new Scanner(System.in);
  
      public static void main(String[] args) throws IOException {
          BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
  
          int n = scanner.nextInt();
          scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
  
          long[] price = new long[n];
  
          String[] priceItems = scanner.nextLine().split(" ");
          scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
  
          for (int i = 0; i < n; i++) {
              long priceItem = Long.parseLong(priceItems[i]);
              price[i] = priceItem;
          }
  
          int result = minimumLoss(price);
  
          bufferedWriter.write(String.valueOf(result));
          bufferedWriter.newLine();
  
          bufferedWriter.close();
  
          scanner.close();
      }
  }
  