#include<cstdio>
using namespace std;
long long n,v[6000000],i,j,k,smax=-2,s,bestSum =-2, beg=0,end,idx=1,Min;

int main()
{
    freopen("ssm.in","r",stdin);
    freopen("ssm.out","w",stdout);
scanf("%lld",&n);
for(i=1;i<=n;i++) scanf("%lld",&v[i]);

for(i=1;i<=n;i++) {
 v[i]+=v[i - 1];
  if (bestSum < v[i] - Min)
           {bestSum = v[i] - Min, beg = idx, end = i;}
  
        if (Min > v[i])
           Min = v[i], idx =i+1;
   }




    printf("%lld %lld %lld",bestSum,beg,end);





return 0;
}