#include<iostream>	
#include<queue>
using namespace std;
int n,ansl,ansr;
long long ls[1000010],ans;
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > q;
int main(){
	freopen("subq.in","r",stdin);
	freopen("subq.out","w",stdout);
    
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%lld",&ls[i]),ls[i]+=ls[i-1];
    ans=-0x3f3f3f3f;
    ansl=ansr=0;
    q.push(make_pair(0,0));
    
    for(int i=1;i<=n;i++){	
    	if(ls[i]-q.top().first>ans){
    		ans=ls[i]-q.top().first;
    		ansl=q.top().second+1;
    		ansr=i;
		}
		q.push(make_pair(ls[i],i));
	}
    
    printf("%d\n%d\n%lld\n",ansl,ansr,ans);
        
    return 0;
}