#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <fstream>
#include <sstream>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <stack>
#include <iomanip>

using namespace std;

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


int main() {
    long long n;
    fin >> n;

    long long sum = 0, maxSum = 0;
    long long startIndex = 0, endIndex = 0, index;
    for (int i = 0; i < n; ++i) {
        int number;
        fin >> number;
        if (sum < 0) {
            sum = 0;
            startIndex = i;
        }
        sum += number;
        if (maxSum < sum) {
            maxSum = sum;
            index = startIndex;
            endIndex = i;
        }
    }

    fout << maxSum << " " << index + 1 << " " << endIndex + 1;

    return 0;
}