#include <bits/stdc++.h>
using namespace std;
int a[999999];
int n,pf1,pf2,p1,p2,x,Max,s;
void cit()
{
    freopen("ssm.in","r",stdin);
    freopen("ssm.out","w",stdout);
}


int main()
{
    cit();
    scanf("%d",&n); p1=1;p2=1;
    Max=-9999999;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&x);
        if(s+x>=x)
        {
            p2=i;
            s=s+x;
        }
        else
        {
            s=x;
            p1=i;p2=i;
        }
        if(s>Max)
        {
            Max=s;
            pf1=p1;
            pf2=p2;
        }
    }
    printf("%d %d %d\n",Max,pf1,pf2);
    return 0;

}