#include<fstream>
#include<algorithm>
using namespace std;
#define Infinit 6000000
ifstream f("ssm.in");
ofstream g("ssm.out");
long long A[6000005],best,N,st,dr;
int main()
{	long long min=0;
	f>>N;
	best=-int(2e9);
	for(long i=1,j;i<=N;i++)
	{	f>>A[i];
		A[i]+=A[i-1];
		if(best<A[i]-min)
		{	best=A[i]-min;
			dr=i;
		}
		if(min>A[i])
		{	min=A[i];
			st=i+1;
		}
	}
	g<<best<<" "<<st<<" "<<dr;
	f.close();
	g.close();
	return 0;
}