#include <cstdio>
#include <algorithm>

using namespace std;

const int NMAX = 6e6+5;

int v[NMAX];

int main(){
	freopen("ssm.in", "r", stdin);
	freopen("ssm.out", "w", stdout);

	int n;
	scanf("%d", &n);

	for(int i=0; i<n; ++i)
		scanf("%d", &v[i]);

	int bsum=v[0], first=0, last=0, sum=v[0], start=0;
	for(int i=1; i<n; ++i){
		start = (sum < 0)*i + (sum >= 0)*start;
		sum = v[i] + (sum >= 0)*sum;

		first = (bsum < sum)*start + (bsum >= sum)*first;
		last = (bsum < sum)*i + (bsum >= sum)*last;
		bsum = (bsum < sum)*sum + (bsum >= sum)*bsum;
	}

	printf("%d %d %d\n", bsum, first+1, last+1);

	return 0;
}