/*
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, x, actualsum, bestsum=-1000000000, Begin=1, End=1, Newbegin=1;
int main()
{
    fin >> n;
    for( int i = 1; i < n; i++ ){
        fin >> x;
        if( actualsum < 0 ){
            actualsum = x;
            Newbegin = i;
        }
        else actualsum += x;
        if( actualsum > bestsum ){
            bestsum = actualsum;
            Begin = Newbegin;
            End = i;
        }
    }
    fout << bestsum <<" "<< Begin <<" "<< End;
    return 0;
}
*/

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

const char iname[] = "ssm.in";
const char oname[] = "ssm.out";

const int MAXN = 7000005;

#define FOR(i, a, b)  for (int i = (a); i <= (b); ++ i)
#define Max(a, b)  ((a) > (b) ? (a) : (b))

int main(void) {
    ifstream in(iname);
    int n, S;
    int bestSum = -int(2e9), sum = 0, beg, end, idx;
    in >> n;
    FOR (i, 1, n) {
        in >> S;
        if (sum < 0)
            sum = S, idx = i;
        else
            sum += S;
        if (bestSum < sum)
            bestSum = sum, beg = idx, end = i;
    }
    ofstream out(oname);
    out << bestSum << " " << beg << " " << end;

    in.close(), out.close();
    return 0;
}