#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 S[MAXN], n;

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