C++ :

#include<bits/stdc++.h>
using namespace std;
long long cf[1000005],a[1000005],z,f,n,ans;
int main(){
    cin>>n;
    for(int i=1;i<=n;++i)
    {
    	scanf("%lld",&a[i]);
    	cf[i]=a[i]-a[i-1];
    	if(cf[i]<0) f+=cf[i];
    		else z+=cf[i];
    }
    z=z-cf[1];
    //cout<<f<<" "<<z<<endl;
    cout<<max(z,abs(f))<<endl;
    cout<<abs(z-abs(f))+1;
    	
    return 0;
}