#include <iostream>
#include <fstream>
long n,l[6000001],k,Max,p,u,first;
using namespace std;

int main()
{
    Max=-0xfffffe;
    ifstream f("ssm.in");
    f>>n;
    f>>k;
    l[1]=k;
    first=1;
    for(int i=2;i<=n;i++)
    {
        f>>k;
        if(l[i-1]>0)
            l[i]=l[i-1]+k;
        else
            l[i]=k,first=i;
        if(l[i]>Max)
            Max=l[i],p=first,u=i;
    }
    while(l[p-1]==0)p--;
    ofstream g("ssm.out");
    g<<Max<<" "<<p<<" "<<u;
    return 0;
}