#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <fstream>
using namespace std;
#define inf 0xfffffff
#define MOD 1999999973

int n, m, p, p1, u, s, s1;

int main() {
	int x;
	
	freopen("ssm.in","r",stdin);
	freopen("ssm.out","w",stdout);
	scanf("%d",  &n);
	scanf("%d", &x);
	p = p1 = u = 1;
	s = s1 = x; 
	for (int i = 2; i <= n; i++) {
		scanf("%d", &x);
		if (s1 + x >= x) {
			s1 += x;
		} else {
			p1 = i;
			s1 = x;
		}
		if (s1 > s) {
			p = p1;
			u = i;
			s = s1;
		}
	}
	
	printf("%d %d %d\n", s, p, u);
	
	return 0;
}