#include<fstream>
using namespace std;

ifstream f("ssm.in");
ofstream g("ssm.out");

long n,i,j; 
long v, sum, best;
long bestSum,minim;
long erst,first, last;

int main()
{f>>n;
sum=0;
minim=0;  first=1;
bestSum=-6000001;
for(i=1; i<=n; i++)
  {f>>v;
   sum=sum+v;
   best=sum-minim;
   if(minim>sum)
     {minim=sum;
      erst=i+1;}
   if(bestSum<best)
     {bestSum=best;
      first=erst;
      last=i;}
     }
if(first>last)
  first=last;     
g<<bestSum<<" "<<first<<" "<<last;

return 0;}