#include <algorithm>
#include <fstream>
#include <iostream>
#include <memory>
#include <vector>
using namespace std;

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

int main() {
    int n, v[n], dp[n], start;
    fin >> n;
    for (int i = 0; i < n; i++) {
        fin >> v[i];
    }

    dp[1] = v[1];
    start = 1;

    for (int i = 1; i <= n; i++) {
        if (dp[i - 1] >= 0) {
            dp[i] = dp[i - 1] + v[i];
        } else if (dp[i - 1] < 0) {
            dp[i] = v[i];
            start = i;
        }
    }

    int maxx = dp[1];
    int end = 0;
    for (int i = 1; i <= n; i++) {
        if (dp[i + 1] > dp[i])
            maxx = dp[i + 1];
            end = i + 1;
    }

    fout << maxx << " " << start << " " << end;

    return 0;
}