#include <fstream>

std::ifstream fin("ssm.in");
std::ofstream fout("ssm.out");

const int N = 6e6, oo = -2e9;

int n, best[N];

int main () {
    fin >> n;

    int x, bestSum = oo, st = 0, dr = 0, maxSt = 0, maxDr = 0;
    fin >> x;
    best[0] = x;
    for(int i = 1; i < n; ++i){
	fin >> x;
	if(x > x + best[i - 1]) {
	    best[i] = x;
	    st = i, dr = i;
	}
	else {
	    best[i] = x + best[i - 1];
	    dr++;
	}
	if(best[i] > bestSum) {
	    bestSum = best[i];
	    maxSt = st, maxDr = dr;
	}
    }

    maxSt++, maxDr++;
    fout << bestSum << ' ' << maxSt << ' ' << maxDr << '\n';

    fin.close();
    fout.close();
    return 0;
}