#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int ii,jj,i,k,j,n,a[6000001],minn=6000010,maxx=-6000010,s;
int main()
{
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>a[i];
    }
    for(i=1;i<=n;i++)
    {
        a[i]=a[i]+a[i-1];
    }
    for(i=1;i<=n;i++)
    {
        if(minn>a[i]){minn=a[i];ii=i;}
        if(i>ii){a[i]=a[i]-minn;}
    }
    for(i=1;i<=n;i++)
    {
        if(maxx<a[i]){maxx=a[i];jj=i;}
    }
    g<<maxx<<" "<<ii+1<<" "<<jj;
    return 0;
}