//#include <fstream>//var III O(n^3) 20p si IV O(n^2) 40p
//#include<cstring>
//#define M 6000001
//using namespace std;
//ifstream fi("ssm.in");
//ofstream fo("ssm.out");
//int a[M],b[M],maxi=-2e9,pi,pf,ss,i,f,k,j,n;
//char ch,e;
//int main()
//{
//  fi>>n;
//  for(i=1;i<=n;i++)fi>>a[i];
////   for(i=1;i<=n;i++)  //var I 20p O(n^3)
////     for(j=i;j<=n;j++)
////      {ss=0;
////       for(k=i;k<=j;k++) ss+=a[k];
////       if(maxi<ss){maxi=ss;pi=i;pf=j;}
////      }
////fo<<maxi<<" "<<pi<< " "<<pf<<'\n';
//////var II O(n^2) 40p
////b[1]=a[1];
////for(i=2;i<=n;i++)b[i]=b[i-1]+a[i];
////   for(i=1;i<=n;i++)
////     for(j=i;j<=n;j++)
////      { ss=b[j]-b[i-1];
////        if(maxi<ss){maxi=ss;pi=i;pf=j;}
////      }
////    fo<<maxi<<" "<<pi<< " "<<pf<<'\n';
//return 0;
//}
//#include<fstream>//var I  O(n) programare dinamica sum[i] = Max(sum[i-1] + a[i], a[i]).
//using namespace std;
//ifstream f("ssm.in");
//ofstream g("ssm.out");
//int n,i,maxi,x,sum,pi,pf,p;
//int main()
//{
//    f>>n>>x;
//    sum=x;p=1;maxi=-2000000000;
//    for(i=2;i<=n;i++)
//    {
//        f>>x;
//        if(sum>=0)sum+=x;
//        else{ sum=x; p=i; }
//        if(maxi<sum){maxi=sum;pi=p;pf=i;}
//    }
//    g<<maxi<<" "<<pi<<" "<<pf;
//    return 0;
//}
//var II  S[i] - Min(S[j]), j < i.
#include<fstream>//100p O(n)
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,maxi,mini,x,sum,pi,pf,p;
int main()
{
    f>>n;
    maxi=-2000000000;mini=0;p=1;
    for(i=1;i<=n;i++)
    {
        f>>x;
        sum=sum+x;
        if(maxi<sum-mini){ maxi=sum-mini; pi=p; pf=i; }
        if(sum<mini){ mini=sum; p=i+1; }
    }
    g<<maxi<<" "<<pi<<" "<<pf;
    return 0;
}