#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];
    fin >> n;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
    }
        sp[0] = 0;
        sp[1] = v[1];
        long long maxim = -5000000000, minim = 5000000000, dif = -5000000000;
        int max_pos = 0, min_pos = 0;
        for (int i = 2; i <= n; ++i) {
            sp[i] = sp[i - 1] + v[i];
        }
        for (int i = 1; i <= n; ++i) {
            if (sp[i] < minim) {
                minim = sp[i];
            }
            if (sp[i] - minim > dif) {
                dif = sp[i] - minim;
                maxim = sp[i];
                max_pos = i;
            }
        }
        minim = maxim;
        for (int i = 1; i < max_pos; ++i) {
            if (sp[i] < minim) {
                minim = sp[i];
                min_pos = i;
            }
        }
        if (min_pos == 1) {
            fout << maxim << " " << 1 << " " << max_pos;
        } else {
            fout << maxim - minim << " " << min_pos + 1 << " " << max_pos;
        }
    return 0;
}