#include <iostream>
#include <cmath>
#include <algorithm>
typedef long long ll;
using namespace std;
const int N=1e+5;
ll b[N+10];
int n;
   ll x1,x2;
    ll pos,neg;
int main(){
    cin>>n;

    for(int i=1;i<=n;i++){
        x2=x1;
        cin>>x1;
        b[i]=x1-x2;
    }

    for(int i=2;i<=n;i++){
        if(b[i]>0)pos+=b[i];
        else neg-=b[i];
    }
    cout<<max(pos,neg)<<endl;
    cout<<abs(pos-neg)+1<<endl;
    return 0;
}