#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, min = 0, min_i = 0;
    for (int i = 1; i <= n; ++i) {
        if (sp[i] - min > max_sum) {
            max_sum = sp[i] - min;
            end = i;
            begin = min_i + 1;
        }
        if (min >= sp[i]) {
            min = sp[i];
            min_i = i;
        }
    }
    fout << max_sum << " " << begin  << " " << end;
    return 0;
}