/** * author: TakeruOkuyama * created: 2020-04-09 14:53:46 **/ #include #define rep(i, n) for(int i = 0; i < (n); i++) using namespace std; using ll = long long; using P = pair; int main(){ int N; cin >> N; vector a(N); rep(i, N){ cin >> a[i]; } int max = a[N - 1] - a[0]; int min = max; rep(i, N - 1){ if((a[i + 1] - a[i]) < min){ min = a[i + 1] - a[i]; } } cout << min << endl << max << endl; return 0;} /** **/