#include <iostream>
#include <stdio.h>
using namespace std;
int const nm=6000007,nr_max=-2000000000;
int v[nm];
int main()
{
    int i,j,bestmin,bestmax,poz,poz1,poz2,n;
    freopen("ssm.in","r",stdin);
    freopen("ssm.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;++i)
    {
        scanf("%d",&v[i]);
        v[i]+=v[i-1];
    }
    bestmin=0-nr_max;
    bestmax=nr_max;
    for(i=1;i<=n;++i)
    {
        if(bestmax<v[i]-bestmin)
            bestmax=v[i]-bestmin,poz1=poz,poz2=i;
        if(bestmin>v[i])
            bestmin=v[i],poz=i+1;
    }
    printf("%d %d %d\n",bestmax,poz1,poz2);
    return 0;
}