#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int n,i,poz1,poz2,x,p1,p2;
long long MAX,sum;
int main()
{
    freopen("ssm.in","r",stdin);
    freopen("ssm.out","w",stdout);
    scanf("%d%d",&n,&x);
    sum=x;
    poz1=1;
    poz2=1;
	MAX=-200000000000000000;
    for (i=2;i<=n;i++)
    {
        scanf("%d",&x);
        if (sum+x>x) { sum=sum+x;
                       poz2=i;
                        }
                else { 
					   sum=x;
                       poz1=i;
                       poz2=i;
                        }
		if (sum>MAX) {
									  MAX=sum;
									  p1=poz1;
									  p2=poz2;
									}

    }
	if (sum>MAX) {
									  MAX=sum;
									  p1=poz1;
									  p2=poz2;
									}
    printf("%lld %d %d",MAX,p1,p2);
    return 0;
}