using namespace std;
#include<vector>
#include<queue>
#include<cstdio>
#define nmax 6000003
int main ()
{
	vector<int>v(nmax),best(nmax);
	long int n,i,bestsum,x,y,s,min,minpoz,secvpoz;
	FILE *f=fopen("ssm.in","r");
	FILE *g=fopen("ssm.out","w");
	fscanf(f,"%ld",&n);
	best[0]=0;
	for(i=1;i<=n;i++)
		fscanf(f,"%d",&v[i]),best[i]=v[i]+best[i-1];
	minpoz=1,bestsum=best[1];
	for(i=2;i<=n;i++)
	{
		if(best[i]<best[i]+best[minpoz])
			best[i]=best[i]+best[minpoz];
		if(best[i]<best[minpoz])
			minpoz=i;
		if(best[i]>bestsum)
			bestsum=best[i],x=minpoz,y=i;
	}
	fprintf(g,"%ld %ld %ld",bestsum,x,y);
	fclose(f);
	fclose(g);
	return 0;
}