from collections import defaultdict
import sys,heapq,bisect,math,itertools,string
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]

min_val = INF

N = int(input())
aa = list(map(int,input().split()))

for i in range(1,N):
	min_val = min(min_val,aa[i]-aa[i-1])

print(min_val)
print(aa[-1]-aa[0])