#include <fstream>
#include <algorithm>

using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");

int n,m,v[6000099],p,laststart,inceput,sfarsit;

int main()
{
    f>>n;
    for (int i=1; i<=n; ++i) f>>v[i];
    int s=0;
    int maxx=-1;
    for (int i=1; i<=n; ++i)
    {
        if (s<0)
        {
            s=v[i];
            laststart=i;
        }
        else s=s+v[i];
        if (s>maxx)
        {
            maxx=s;
            inceput=laststart;
            sfarsit=i;
        }
    }
    g<<maxx<<' '<<inceput<<' '<<sfarsit<<'\n';
    f.close();
    g.close();
    return 0;
}