#include <iostream>
#include<fstream>

using namespace std;

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

int s[7000005], n;

int main()
{
    fin >> n;
    for(int i = 0; i < n; ++i)
        fin >> s[i];
    int countMax = (s[1] + s[0]), j, k, ind = 0, mini = 0;
    for(int i = 1; i < n; ++i)
    {
        s[i] += s[i-1];
        if(countMax < s[i] - mini)
        {
            countMax = s[i] - mini;
            j = ind+1;
            k = i;
        }
        if(mini > s[i]){
            mini = s[i];
            ind = i;

        }
    }
    fout << countMax << ' ' << j+1 << ' ' << k+1;
    return 0;
}