package zkj;
import java.math.*;
import java.io.*;
import java.math.*;
import java.util.Scanner;
import java.util.Stack;
import java.util.linkedList;
import java.util.Queue;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Iterator;
import java.util.Comparator;
public class Zz {
public static void main(String[] args) {
ArrayListaa=new ArrayList<>();
int n;
Scanner cin=new Scanner (System.in);
n=cin.nextInt();
int x;
for(int i=1;i<=n;i++)
{
x=cin.nextInt();
aa.add(x);
}
//排序,前减后是递增,后减前是递减
aa.sort(new Comparator() {
public int compare(Integer o1,Integer o2)
{
return o1-o2;
}
});
/*for(int i=0;i
int d=aa.get(1)-aa.get(0);
for(int i=0;i