#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
const int M = 7000005;

int a[M], n, i;

int main(void) {
	f >> n;
	for (i = 1; i <= n; i++)
		f >> a[i];

	int bestSum = -int(2e9), sum = 0, beg, end, idx;
	for (i = 1; i <= n; i++)
	{
		if (sum < 0)
			sum = a[i], idx = i;
		else
			sum += a[i];
		if (bestSum < sum)
			bestSum = sum, beg = idx, end = i;
	}
	g << bestSum << " " << beg << " " << end;
	return 0;
}