#include<cstdio>
#define DN 6000001
#define LL long long
LL sum[DN], mn, bestSum, n, i, best[DN], a[DN], p1, p2, ok;
int main()
{
	freopen("ssm.in", "r", stdin);
	freopen("ssm.out", "w", stdout);
	sum[0]=0;
	scanf("%lld", &n);
	bestSum = a[1];
	for(i=1; i<=n; ++i) 
	{
		ok=0;
		scanf("%lld", &a[i]);
		best[i]=a[i];
		if(best[i]<best[i-1]+a[i]) 
		{
			best[i]=best[i-1]+a[i];
		}
		else
			ok=1;
		if (bestSum<best[i])
		{
			bestSum=best[i];
			p2=i;
		}
		else
			if(ok==1)
				p1=i;
	}
	printf("%lld %lld %lld", bestSum, p1, p2);
}