#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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


int main() {
    int n, x, max = 0, s, inc, sf;
    vector<int> v;
    fin >> n;
    for (int i = 1; i <= n; i++) {
        fin >> x;
        v.push_back(x);
    }

    for (int i = 0; i < n; i++)
        for (int j = i; j < n; j++) {
            s = 0;
            for (int k = i; k <= j; k++)
                s += v[k];
            if (s > max) {
                max = s;
                inc = i;
                sf = j;
            }
            else if (s == max)
                if (i < inc){
                    max = s;
                    inc = i;
                    sf = j;
                }
                else if (i == inc && j < sf){
                    max = s;
                    inc = i;
                    sf = j;
                }

        }
    fout << max << ' ' << inc + 1 << ' ' << sf + 1;

}