#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");

int n,v[6000006],best[6000006];
int sp[6000006];
int minim = INT_MAX;
int maxim =  INT_MIN;
int maxpoz=1,minpoz =1;

int main()
{

    f>>n;
    for(int i=1;i<=n;i++)
        f>>v[i];
    sp[-1] = INT_MIN;
    for(int i=1;i<=n;i++)
    {
        sp[i] = sp[i-1] + v[i];
        if(sp[i-1]<minim){
            minim = sp[i-1];
        }
        best[i] = sp[i] - minim;
        if(best[i] > maxim){
            maxim = best[i] ;
            maxpoz = i;
        }
    }
    int i = maxpoz;
    int sum = v[maxpoz];
    while (sum != maxim && sum < maxim)
    {
        i--;
        sum+=v[i];
    }
    g<<maxim<<' '<<i<<' '<<maxpoz;

    return 0;
}