/*#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
const int MAXN = 7000005;
int main()
{
	int n, S[MAXN],i,j;
	f>>n;
	for(i=1;i<=n;i++)
		f>>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;
	}
	g<<bestSum<<' '<<beg<<' '<<end;
	f.close();
	g.close();
	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 S[MAXN], n;

int main(void) {
ifstream in(iname);
in >> n;
FOR (i, 1, n)  in >> 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;
}
ofstream out(oname);
out << bestSum << " " << beg << " " << end;
in.close(), out.close();
return 0;
}