//Enunt: http://www.infoarena.ro/job_detail/2076479?action=view-source
#include <iostream>
#include <fstream>

using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int N,sp[6000000];
int main()
{
    int INT_MAX=0x3f3f3f3f;
    in>>N;
    int s[N];
    for(int i=0;i<N;++i)
    {
        in>>s[i];
        for(int j=0;j<=i;++j)
            sp[i]+=s[j];
    }
    int max=-INT_MAX,ii,jj;
    for(int i=0;i<N;++i)
        for(int j=1+i;j<N;++j)
            if((sp[j]-sp[i-1])>max)
            {
                ii=i+1;
                jj=j+1;
                max=sp[j]-sp[i-1];
            }
    out<<max<<' '<<ii<<' '<<jj;
    return 0;
}