#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const int MAXN = 7000005;
int S[MAXN], n,i;
int main(void) {
    ifstream in("ssm.in");
    in >> n;
    for (i=1;i<=n;i++)  
		in >> S[i];
    int bestSum = -int(2e9), min = 0, idx, beg, end;
    for (i=1;i<=n;i++)  
	{
        S[i] += S[i - 1];
        if (bestSum < S[i] - min)
            bestSum = S[i] - min, beg = idx + 1, end = i;
        if (min > S[i])
            min = S[i], idx = i;
    }
    ofstream out("ssm.out");
    out << bestSum << " " << beg << " " << end;

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