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

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

const int MAX_SIZE = 6000001;
int v[MAX_SIZE], sp[MAX_SIZE];

int main() {
    int n;
    fin >> n;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
    }
    for (int i = 1; i <= n; ++i) {
        sp[i] = v[i] + sp[i - 1];
    }
    int max_sum = v[1], begin = 0, end = 0;
    for (int i = 1; i < n; ++i) {
        for (int j = i + 1; j <= n; ++j) {
            if (sp[j] - sp[i - 1] > max_sum) {
                max_sum = sp[j] - sp[i - 1];
                begin = i;
                end = j;
            } else if (sp[j] - sp[i - 1] == max_sum && j - i + 1 < end - begin + 1) {
                max_sum = sp[j] - sp[i - 1];
                begin = i;
                end = j;
            }
        }
    }
    fout << max_sum << " " << begin << " " << end;
    return 0;
}