#include<bits/stdc++.h>
using namespace std;

#define int long long

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
#ifdef CB
	freopen("be1.txt","r",stdin);
//	freopen("ki.txt","w",stdout);
#endif
	int N;
	cin>>N;
	vector<int>v(N+1),p(N+1);
	for(int i=1;i<=N;i++){
		cin>>v[i];
		p[i]=p[i-1]+v[i];
	}
	int l=v[1],h=p[N];
	while(l<h){
		int m=(l+h)/2;
		int ok=1;
		int mn=0;
		for(int i=1;i<=N;i++){
			mn=max(mn,(v[i]+1)/2);
		}
		int x=0;
		int a=0;
		for(int i=1;i<=N;i++){
			int y=min(x,m-(m%2!=x%2));
			a=min(abs(a-v[i]),abs(y-v[i]));
			x+=v[i];
			if(y>=v[i]){
				a=min(a,x&1);
			}
			mn=max(mn,a);
		}
		x=0;
		a=0;
		for(int i=N;i>=1;i--){
			int y=min(x,m-(m%2!=x%2));
			a=min(abs(a-v[i]),abs(y-v[i]));
			x+=v[i];
			if(y>=v[i]){
				a=min(a,x&1);
			}
			mn=max(mn,a);
		}
		ok&=mn<=m;
		if(ok){
			h=m;
		}
		else{
			l=m+1;
		}
	}
	cout<<h<<'\n';
	l=v[1],h=p[N];
	while(l<h){
		int m=(l+h)/2;
		int ok=0;
		for(int i=1;i<=N;i++){
			if(p[i]>=m&&p[N]-p[i]>=m){
				ok=1;
			}
		}
		if(ok){
			l=m+1;
		}
		else{
			h=m;
		}
	}
	cout<<l-1<<'\n';
	return 0;
}