#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;
    int all_positive = 0, all_negative = 0, s = 0;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
        if (v[i] >= 0) {
            ++all_positive;
        } else {
            ++all_negative;
        }
        s += v[i];
    }
    if (all_negative == n) {
        long long maxim = -5000000000, pos = 0;
        for (int i = 1; i <= n; ++i) {
            if (v[i] > maxim) {
                maxim = v[i];
                pos = i;
            }
        }
        fout << maxim << " " << pos << " " << pos;
    } else if (all_positive == n) {
        fout << s << " " << 1 << " " << n;
    } else {
        sp[0] = 0;
        sp[1] = v[1];
        long long maxim = -5000000000, minim = 5000000000;
        for (int i = 2; i <= n; ++i) {
            sp[i] = sp[i - 1] + v[i];
        }
        int sum, i1 = 0, i2 = 0;
        for (int i = 0; i <= n; ++i) {
            if (sp[i] < minim) {
                minim = sp[i];
                i1 = i + 1;
            }
        }
        for (int i = i1; i <= n; ++i) {
            if (sp[i] > maxim) {
                maxim = sp[i];
                i2 = i;
            }
        }
        if (i2 < i1) {
            fout << maxim - minim << i2 << " " << i1;
        } else {
            fout << maxim  -  minim << " " << i1 << " " << i2;
        }
    }
    return 0;
}