#include <algorithm>
using namespace std;

#define INF 0x3f3f3f3f
#define DIM 6000005

int n,best,start,end;
int v[DIM];

void read ()
{
    int i;

    scanf ("%d",&n);
    for (i=1; i<=n; ++i)
        scanf ("%d",&v[i]);
}

void solve ()
{
    int i,sum,indx;

    best=-INF;
    sum=indx=0;
    for (i=1; i<=n; ++i)
    {
        if (sum<0)
        {
            sum=v[i];
            indx=i;
        }
        else
            sum+=v[i];
        if (sum>best)
        {
            end=i;
            best=sum;
            start=indx;
        }
    }
    printf ("%d %d %d",best,start,end);
}

int main ()
{
    freopen ("ssm.in","r",stdin);
    freopen ("ssm.out","w",stdout);

    read ();
    solve ();

    return 0;
}