#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
struct best
{
    int val;
    int minim;
}b[6000006];
int n,v[6000006];
int sp[6000006];
int minim = INT_MAX;
int maxim =  INT_MIN;
int maxpoz=1;

int main()
{

    f>>n;
    for(int i=1;i<=n;i++)
        f>>v[i];

    for(int i=1;i<=n;i++)
    {
        sp[i] = sp[i-1] + v[i];
        if(sp[i-1]<minim){
            minim = sp[i-1];
            b[i].minim = i;
        }

        b[i].val = sp[i] - minim;
        if(b[i].val > maxim){
            maxim = b[i].val ;
            maxpoz = i;
        }
    }

    g<<maxim<<' '<<b[maxpoz].minim<<' '<<maxpoz;

    return 0;
}