#include <fstream>
using namespace std;

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

int n, v[6000001];

int main() {
	int best = 0, start_idx = 1, end_idx = 1, maxBest = 0;
	fin >> n;
	for (int i = 1; i <= n; ++i) {
		fin >> v[i];
		if (v[i] + best >= v[i]) {
			best += v[i];
		} else {
			best = v[i];
			start_idx = end_idx = i;
		}
		if (best > maxBest) {
			maxBest = best;
			end_idx = i;
		}
	}
	fout << maxBest << " " << start_idx << " " << end_idx;
	return 0;
}

/*
	-- Varianta cu 40p, TLE, O(n^2)
int main() {
	fin >> n;
	for (int i = 1; i <= n; ++i) {
		fin >> v[i];
	}
	int max = v[1], left = 0, right = 0;
	for (int i = 1; i < n; ++i) {
		int sum = 0;
		for (int j = i; j <= n; ++j) {
			sum += v[j];
			if (sum > max) {
				max = sum;
				left = i;
				right = j;
			}
		}
	}
	fout << max << " " << left << " " << right;
	return 0;
}
*/