#include <fstream>
///Algoritmul lui Kadane-subsecventa de suma maxima
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
    int n, a[500000], st, dr; fin>>n;
    for(int i=0; i<n; i++)
      fin>>a[i];
   int most=a[0], s=a[0];
   for(int i=1; i<n; i++)
   {
      s+=a[i];
      if(most<s)
      {
        most=s;
        dr=i+1;
      }
      if(s<0)
      {
        s=0;
        st=i+1;
      }
   }
    fout<<most<<" "<<st+1<<" "<<dr;
    fin.close();
    fout.close();
    return 0;
}