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

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

int main() {
    const int MAX_LENGTH = 6000000;
    int n, v[MAX_LENGTH + 1], sp[MAX_LENGTH + 1], sum = 0;
    fin >> n;
    int counter = 0;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
        sum += v[i];
    }
    for (int i = 1; i < n; ++i) {
        if (v[i] == v[i + 1]) {
            ++counter;
        }
    }
    if (counter == n - 1) {
        fout << sum << " " << 1 << " " << n;
    } else {
        sp[0] = 0;
        sp[1] = v[1];
        long long maxim = -1000000000000, minim = 1000000000000;
        for (int i = 2; i <= n; ++i) {
            sp[i] = sp[i - 1] + v[i];
        }
        int i1 = 0, i2 = 0;
        for (int i = 1; i <= n; ++i) {
            if (sp[i] < minim) {
                minim = sp[i];
                i1 = i;
            }
            if (sp[i] > maxim) {
                maxim = sp[i];
                i2 = i;
            }
        }
        fout << maxim - minim << " " << i1 + 1 << " " << i2;
    }
    return 0;
}