#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n,v[6000006];
int sp[6000006],best[6000006];
int minim = INT_MAX;
int maxim =  INT_MIN;
int main()
{
    int minpoz,maxpoz;
    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];
        for(int j=0;j<=i-1;j++)
        {
            if(sp[j]<minim){
                minim = sp[j];
                minpoz = j+1;
            }

        }
        best[i] = sp[i] - minim;
        if(best[i] > maxim){
            maxim = best[i];
            maxpoz = i;
        }
    }g<<maxim<<' '<<minpoz<<' '<<maxpoz;
    return 0;
}