#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("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() {
    f>> n;
    FOR (i, 1, n)  f >> S[i];
    int bestSum = -int(2e9), beg, end;
    FOR (i, 1, n) FOR (j, i, n) {
        int sum = 0;
        FOR (k, i, j)  sum += S[k];
        if (sum > bestSum)
            bestSum = sum, beg = i, end = j;
    }
    g<< bestSum << " " << beg << " " << end;

    return 0;
}