#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
const int MAXN = 7000005;
int S[MAXN], n;
int main(void) {
    f >> n;
    for (int i = 1; i <= n; i++)
        f >> S[i];
    int bestSum = -100000000, sum = 0, beg, fin, idx;
    for (int i = 1; i <= n; i++) {
        if (sum < 0){
            sum = S[i];
            idx = i;
        }
        else
            sum = sum + S[i];
        if (bestSum < sum){
            bestSum = sum;
            beg = idx;
            fin = i;
        }
    }
    g << bestSum << " " << beg << " " << fin;
    return 0;
}