#include <fstream>

using namespace std;

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

int sir[6000001];

int main() {
    int n;
    fin >> n;
    for (int i = 1; i <= n; ++i) {
        fin >> sir[i];
    }

    int bestSum = -2000000000, bestBegin, bestEnd;
    int sum = 0, currentBegin = 1;

    for (int i = 1; i <= n; ++i) {
        sum += sir[i];

        if (sum < 0) {
            sum = sir[i];
            currentBegin = i;
        }
        if (sum > bestSum) {
            bestEnd = i;
            bestSum = sum;
            bestBegin = currentBegin;
        }
    }

    fout << bestSum << ' ' << bestBegin << ' ' << bestEnd << '\n';
    return 0;
}