#include <fstream>

std::ifstream bem("ssm.in");
int n;
std::ofstream kim("ssm.out");

void ssm(){
	int best, elem, most = 1, max = 0, kezdet = 1, vege = 1;
	bem >> best;
	for(int i = 2; i <= n; i++){
		bem >> elem;

		if(best + elem > elem)
			best += elem;
		else{
			best = elem;
			most = i;
		}
		if(best > max){
			max = best;
			kezdet = most;
			vege = i;
		}
	}
	kim << max << " " << kezdet << " " << vege << "\n";
}

int main(){
	bem >> n;
	ssm();
	bem.close();
	kim.close();
	return 0;
}