#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

const int nMax = 6000005;

int n, spActual, x;

int main(){
    //ifstream fin("date.in");
    ifstream fin("ssm.in");
    ofstream fout("ssm.out");

    fin >> n;


    int bestSum = -int(2e9), minn = 0, incp = 0, sf_secv = 0, incp_secv = 0;

    for(int i = 1; i <= n; ++i){
        fin >> x;
        spActual += x;

        if(bestSum < spActual - minn){
            sf_secv = i;
            incp_secv = incp + 1;

            bestSum = spActual - minn;
        }

        if(spActual < minn){
            minn = spActual;
            incp = i;
        }

    }

    fout << bestSum << " " << incp_secv << " " << sf_secv << "\n";

    return 0;
}