//#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;


string file = "ssm";
ifstream f(file + ".in");
ofstream g(file + ".out");


long long v[6000001], sp[6000001];

int main()
{
    long long n, i, j, imax=1, jmax=1, maxx=0;
    f >> n;
    for (i = 1; i <= n; i++) f >> v[i], sp[i]=v[i]+sp[i-1];
    for (i = 1; i <= n; i++) 
    {
        for (j = i; j <= n; j++)
        {
            if (i == 1 && j == 1) maxx = v[1];
            else if (sp[j] - sp[i - 1] > maxx) {
                maxx = sp[j] - sp[i - 1];
                imax = i;
                jmax = j;
            }
        }
    }
    g << maxx << " " << imax << " " << jmax;
    return 0;

}