#include<stdio.h>
int best, min=0,x,first,last,a,n,i,S[1000];

int main()
{

freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdin);

scanf("%d", &n);
for(i=1;i<=n;i++);
 {
 scanf("%d", &S[i]);
// S[i]=S[i-1]+a;
 }

for(i=1;i<=n;i++)
 {
  S[i] += S[i - 1];
  if (best<S[i]-min)
		{
		 best=S[i]-min;
		 first=x+1;
		 last=i;
		}
  if(min>S[i]){
	      min=S[i];
	      x=i;
	     }

  }

printf("%d %d %d", best, first, last);
return 0;

}