#include<fstream>
using namespace std;

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

long n,i,j; 
long v[1000001], sum[1000001], best[100001];
long bestSum,minim;
long first, last;

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