#include <stdio.h>
#include <algorithm>
using namespace std;
int n,i,inc,sf,ma,b;
int best,x,ix;

int main()
{
	FILE * f;
	f=fopen("ssm.in","r");
	FILE * g;
	g=fopen("ssm.out","w");
	fscanf(f,"%d",&n);
	b=0;
	ix=sf=inc=1;
	best=-int(2e9);
	for (i=1;i<=n;++i)
	{
		fscanf(f,"%d",&x);
		if (b<0)
		{
			b=x;
			ix=i;
		}
		else
			b+=x;
		if (b>best)
		{
			best=b;
			inc=ix;
			sf=i;
		}
	}
	fprintf(g,"%d %d %d",best,inc,sf);
	fclose(f);
	fclose(g);
	return 0;
}