#include <iostream>
#include <fstream>
using namespace std;

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

int v[6000001];

int main() {
    int n, startPos = 0, endPos = 0;
    long long maxSum = 0, sum = 0;
    fin >> n;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= i; ++j) {
            sum = 0;
            for (int k = j; k <= i; ++k) {
                sum += v[k];
            }
            if (sum > maxSum) {
                maxSum = sum;
                startPos = j;
                endPos = i;
            }
        }
    }
    fout << maxSum << " " << startPos << " " << endPos;
    return 0;
}