#include <iostream>

#include <algorithm>

using namespace std;

int n, v[6000000];

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> v[i];
    int maxSum = - 1 << 31, sum = 0, beg, endi, index;
    for (int i = 1; i <= n; i++) {
        if (sum < 0) {
            sum = v[i];
            index = i;
        }
        else
            sum += v[i];
        if (sum > maxSum) {
            maxSum = sum;
            beg = index;
            endi = i;
        }
    }
    cout << maxSum << ' ' << beg << ' ' << endi;
    return 0;
}