#include <cstdio>
#include <algorithm>
using namespace std;

const char iname[] = "ssm.in";
const char oname[] = "ssm.out";

const int MAXN = 7000005;

#define FOR(i, a, b)  for (int i = (a); i <= (b); ++ i)
#define Max(a, b)  ((a) > (b) ? (a) : (b))

int S[MAXN], n, bestSum = -int(2e9), beg, end;

void F(int lo, int hi) {
    if (hi == lo) {
        if (bestSum < S[hi])
            bestSum = S[hi], beg = end = hi;
        return ;
    }
    int mid = (hi + lo) / 2;
    F(lo, mid);
    F(mid + 1, hi);

    int suf = 0, pre = 0, left, right;
    int maxSuf = -int(1e9), maxPre = -int(1e9);

    for (int i = mid; i >= lo; -- i) {
        suf += S[i];
        if (maxSuf <= suf)  maxSuf = suf, left = i;
    }
    for (int i = mid + 1; i <= hi; ++ i) {
        pre += S[i];
        if (maxPre < pre)  maxPre = pre, right = i;
    }
    if (maxPre + maxSuf > bestSum)
        bestSum = maxPre + maxSuf, beg = left, end = right;
}

int main(void) {
    freopen(iname, "r", stdin);
    scanf("%d", &n);
    FOR (i, 1, n)  scanf("%d", &S[i]);

    freopen(oname, "w", stdout);
    F(1, n);
    printf("%d %d %d", bestSum, beg, end);

    return 0;
}