#include<bits/stdc++.h>
using namespace std;
const int maxN = 1e6 + 10;
int a[maxN];
int ans = -1e9,n,lol = 1e9,lef,rig;
int main(void){
	freopen("subq.in","r",stdin);
	freopen("subq.out","w",stdout);
	scanf("%d",&n);
	for (int i = 1;i<=n;i++){
		scanf("%d",&a[i]);
		a[i] += a[i-1];
	}
	for (int i = 0;i < n;i ++){
		if (lol > a[i]){
			lol = a[i];
			a[n + 1] = i;
		}
		if (ans < a[i + 1] - lol){
			ans = a[i + 1] - lol;
			rig = i + 1;
			lef = a[n + 1] + 1;
		}
	}
	printf("%d\n%d\n%d\n",lef,rig,ans);
	return 0;
}