#include <cstdio>

#define max(a,b) ((a) > (b) ? (a) : (b))

using namespace std;

int n,a[1000001],best[1000001],ma=-1,aux;

int main()
{
    int xs,xf,sum;
    freopen("ssm.in","r",stdin);
    freopen("ssm.out","w",stdout);
    scanf("%i",&n);
    for(int i=0;i<n;i++)
        scanf("%i",&a[i]);
    best[0] = a[0];
    for(int i=1;i<n;i++)
    {
        best[i] = max(best[i-1]+a[i],a[i]);
        if(best[i] > ma)
        {
            xf = i;
            ma = best[i];
        }
    }
    sum = ma;
    xs=xf;
    while(sum != 0)
    {
        sum -= a[xs];
        xs--;
    }
    xs++;
    printf("%i %i %i",ma,xs+1,xf+1);
    return 0;
}