#include <fstream> /// 95p ???
using namespace std;

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

int sum[6000001];

int main()
{
    int n, Min = 0, bestSum = -int(2e9), aux, pozMin, pozMax;
    fin >> n;
    for(int i = 1; i <= n; ++i)
    {
        fin >> sum[i];
        sum[i] += sum[i - 1];
        if(Min > sum[i])
        {
            Min = sum[i];
            aux = i;
        }
        if(bestSum < sum[i] - Min)
        {
            bestSum = sum[i] - Min;
            pozMin = aux + 1;
            pozMax = i;
        }
    }
    fout << bestSum << " " << pozMin << " " << pozMax;
    return 0;
}

/// Solutia oficiala 100p

/*#include <iostream>
#include <fstream>
#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;

int main(void) {
    ifstream in(iname);
    in >> n;
    FOR (i, 1, n)  in >> S[i];

    // In rezolvarea de mai jos, S[i] retine suma tuturor valorile intre pozitiile 1 .. i
    // best[i] = Max(S[i] - S[j]) cu j < i =>
    // best[i] = S[i] - Min(S[j]) cu j < i
    int bestSum = -int(2e9), min = 0, idx, beg, end;
    FOR (i, 1, n) {
        S[i] += S[i - 1];
        if (bestSum < S[i] - min)
            bestSum = S[i] - min, beg = idx + 1, end = i;
        if (min > S[i])
            min = S[i], idx = i;
    }
    ofstream out(oname);
    out << bestSum << " " << beg << " " << end;

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