import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.StringTokenizer; import java.io.IOException; import java.util.InputMismatchException; import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); Task716 solver = new Task716(); solver.solve(1, in, out); out.close(); } static class Task716 { public void solve(int testNumber, InputReader in, PrintWriter out) { int n = in.nextInt(); int[] a = in.nextIntArray(n); int min = Integer.MAX_VALUE; for (int i = 0; i < n - 1; i++) { min = Math.min(min, a[i + 1] - a[i]); } out.println(min); out.println(a[n - 1] - a[0]); } } static class InputReader { private BufferedReader br; private StringTokenizer st; public InputReader(InputStream inputStream) { br = new BufferedReader(new InputStreamReader(inputStream)); st = new StringTokenizer(""); } public String nextString() { while (!st.hasMoreTokens()) { try { st = new StringTokenizer(br.readLine(), " "); } catch (IOException e) { throw new InputMismatchException(); } } return st.nextToken(); } public int nextInt() { return Integer.parseInt(nextString()); } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } } }