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

//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 main(void) {
    freopen("ssm.in", "r", stdin);
    freopen("ssm.out", "w", stdout);
    int n, S;
    int bestSum = -int(2e9), sum = 0, beg, end, idx;
    cin >> n;
    for(int i = 1; i <= n; ++i) {
        cin >> S;
        if (sum < 0)
            sum = S, idx = i;
        else
            sum += S;
        if (bestSum < sum)
            bestSum = sum, beg = idx, end = i;
    }


    cout << bestSum << " " << beg << " " << end;

    //in.close(), out.close();
    return 0;
}