#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

typedef long long ll;
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], bfi=1, blen=0;
	int sum=v[0], fi=1, len=0;
	for(int i=1; i<n; ++i){
		if(sum < 0){
			sum = v[i];
			fi = i+1;
			len = 0;
		}else{
			sum += v[i];
			len++;
		}
		if(bsum < sum){
			bsum = sum;
			bfi = fi;
			blen = len;
		}
	}

	printf("%d %d %d\n", bsum, bfi, bfi + blen);

	return 0;
}