#include <iostream> #include <cmath> #include <algorithm> using namespace std; typedef long long LL; const int N = 100010; int a[N]; int main() { int n; cin >> n; for(int i = 1; i <= n; ++ i) cin >> a[i]; for(int i = n; i >= 2; -- i) a[i] -= a[i - 1]; LL pos = 0, neg = 0; for(int i = 2; i <= n; ++ i) { if(a[i] > 0) pos += a[i]; else if(a[i] < 0) neg -= a[i]; } cout << max(pos, neg) << endl; cout << abs(pos - neg) + 1 << endl; return 0; }