#include<fstream>
#include<string.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");

int v[6000001];

int main() {
    int n,i,j,max=-1000000000;
    f>>n;
    int sc=0, p, st, dr;
    //p = pozitia de inceput a celei mai bune secvente care se termina pe poz curenta
    for(int i=1; i<=n; i++) {
        f>>v[i];
        if(sc<0)
        {
            sc = 0;
            p = i;
        }
        sc+=v[i];
        if(sc>max)
        {
            max = sc;
            st = p;
            dr = i;
        }
    }
    g<<max<<' '<<st<<' '<<dr;
    return 0;

}