#include <iostream>
#include <fstream>
#include <limits.h>
#include <deque>

using namespace std;

ifstream fin("ssm.in");
ofstream fout("ssm.out");

const int MAX=6e6+5;
int n,v[MAX],sum,summax=INT_MIN,x,y;
deque < int > dq;

int main()
{
    fin >> n;
    dq.push_back(0);
    for(int i=1;i<=n;i++)
    {
        fin >> v[i];
        v[i]+=v[i-1];
        sum=v[i]-v[dq.front()];
        if(sum>summax)
        {
            x=dq.front()+1;
            y=i;
            summax=sum;
        }
        while(!dq.empty() && v[dq.back()]>v[i])
            dq.pop_back();
        dq.push_back(i);
    }
    fout << summax << " " << x << " " << y;
    return 0;
}