#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;
    for (int left = 1; left <= n; ++left) {
        for (int right = left; right <= n; ++right) {
            sum = 0;
            for (int i = left; i <= right; ++i) {
                sum += sir[i];
            }

            if (sum > bestSum) {
                bestSum = sum;
                bestBegin = left;
                bestEnd = right;
            }
        }
    }

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