#include<fstream>
using namespace std;
int subsecv,minim,n,a[6000001],sum[6000001],best[6000001],bestSum,pp,i,p,u;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main(){
    fin>>n;
    for(i=1;i<=n;i++){
        fin>>a[i];
    }
    sum[0]=0;
    for(i=1;i<=n;i++){
        sum[i]=sum[i-1]+a[i];  //suma elementelor din subsecventa a[1..i]
    }
    minim=sum[0];
    bestSum=sum[1];
    for(i=1;i<=n;i++){
        best[i]=sum[i]-minim; //subsecventa de suma maxima cu capatul drept in i = sum[i]-min(sum[j-1])
        if(minim>sum[i]){
            minim=sum[i];
            pp=i+1; // i este j-1, deci i+1 este j
        }
        if(bestSum<best[i]){
            bestSum=best[i];
            u=i;
            p=pp;
        }
    }
    fout<<bestSum<<" "<<p<<" "<<u;

    return 0;
}