#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int MAXN = 7000005;

#define FOR(i, a, b)  for (int i = a; i <= b; i++)

int S[MAXN], n;

int main() 
{
    fin >> n;
    FOR (i, 1, n)  
		fin >> S[i];
    int bestSum = -int(2e9), min = 0, idx, beg, end;
    FOR (i, 1, n) 
	{
        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;
    }
	fout << bestSum << " " << beg << " " << end;

    fin.close();
	fout.close();
    return 0;
}