#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int main(){
  int point_num;
  cin >> point_num;
  vector<int> point(point_num);
  for(int i=0;i<point_num;i++){
    cin >> point[i];
  }
  int min = point[point_num-1];
  for(int i=0;i<point_num-1;i++){
    if(point[i+1]-point[i] < min) min=point[i+1]-point[i];
  }
  cout << min << "\n" << point[point_num-1]-point[0] << endl;
  return 0;
}