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

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