#include <iostream>
#include <fstream>

using namespace std;
ifstream fcin("euclid2.in");
ofstream fout("euclid2.out");

int n, x, s[6000001], st, dr;
int MIN, bestSum;

int main()
{
    fcin>>n;
    for (int i=1; i<=n; i++)
    {
        fcin>>x;
        s[i]=s[i-1]+x;
    }
    MIN=1;
    bestSum=1;
    for (int i=2; i<=n; i++)
    {
        if(bestSum<s[i]-s[MIN])
        {
            bestSum=s[i]-s[MIN];
            st=MIN+1;
            dr=i;
        }
        if(s[MIN]> s[i])
            MIN=i;
    }
    fout<<bestSum<<" "<<st<<" "<<dr;
}