#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <map>
#include <iomanip>
#include <climits>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000001];
int sumapart[6000001];
int main()
{
    int n;
    in >> n;
    bool doarneg = false;
    int max1 =0;
    int indiceneg =0;
    for(int i =1; i<= n ; i++){
        in >> v[i];
        if ( v[i] > max1){
            max1 = v[i];
            indiceneg = i;
        }
        if ( v[i] > 0){
            doarneg = true;
        }
        v[i] = v[i]+v[i-1];
    }
    if ( doarneg == false){
        out << max1 << ' ' << indiceneg << ' ' << indiceneg;
        return 0;
    }
    int minimum = 9999999;
    int indicemin = 9999999;
    int maximum = 0;
    int indicemax = 0;
    for(int i =1; i<= n ; i++){
      if ( v[i] < minimum){
        minimum = v[i];
        indicemin = i;
      }
      if ( v[i] - minimum > maximum){
        maximum = v[i]-minimum;
        indicemax = i;
      }
    }
   out << maximum << ' ' << indicemin+1 << ' ' << indicemax;
}