#include<iostream>
#include<fstream>
using namespace std;
int main()
{
	
long bestSum,sum[60000],best[60000],i,N,max1,max2,min,a[60000];
fstream f("ssm.in",ios::in);
f>>N;
for(i=1;i<=N;i++)
	f>>a[i];
f.close();

sum[0] = 0;
for (i = 1; i <= N; i++) sum[i] = a[i] + sum[i-1];
min = sum[0];
bestSum=-9999999;
for (i = 1; i <= N; i++) {
    best[i] = sum[i] - min;
    if (min > sum[i]) 
		{min = sum[i];
	max1=i+1;
	
		}
    if (bestSum < best[i]) 
		{bestSum = best[i];
	max2=i;
		}
}
	


	fstream g("ssm.out",ios::out);
	g<<bestSum<<" "<<max1<<" "<<max2;
	g.close();
}