#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;
    for(int i =1; i<= n ; i++){
        in >> v[i];
        v[i] = v[i]+v[i-1];
    }
    int minimum = INT_MAX;
    int indicemin = 1;
    int maximum = INT_MIN;
    int indicemax = 1;
    for(int i =1; i<= n ; i++){
      if (v[i] < minimum){
        minimum = v[i];
        indicemin = i+1;
      }
      if ( v[i] - minimum > maximum){
        maximum = v[i]-minimum;
        indicemax = i;
        if ( v[i] == minimum){
            indicemin--;
        }
      }
    }
   out << maximum << ' ' << indicemin << ' ' << indicemax;
}