#include<stdio.h>
int a,best[6000003],i,j,n,bestie,x,y,xi,yi,xu,yu;

using namespace std;
int main()
{
	freopen("ssm.in","r",stdin);
	freopen("ssm.out","w",stdout);
	scanf("%d",&n);
	
	for(i=1;i<=n;++i)
		{
			scanf("%d",&a);
			if(i==1)
			bestie=a;
			best[i]=a;
			xu=x;
			yu=y;
			x=y=i;
			if(best[i]<best[i-1]+a)
			{
				best[i]=best[i-1]+a;
				x=xu;
				y=yu+1;
			}
		if(bestie<best[i])
			{
				xi=x;
				yi=y;
				bestie=best[i];
			}
		}
	printf("%d %d %d\n",bestie,xi,yi);
	return 0;}