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

int n, s, x, Max, p1, p2, P1, P2;

int main ()
{
    f >> n;
    f >> x;
    s=x;
    Max=x;
    p1=p2=P1=P2=1;

    for (int i=2; i<=n; i++)
    {
        f >> x;
        if (s+x>=x)
        {
            s+=x;
            p2=i;
        }
        else
        {
            s=x;
            p1=p2=i;
        }
        if (s>Max)
        {
            Max=s;
            P1=p1;
            P2=p2;
        }
    }
    g << Max << " " << P1 << " " << P2;
    return 0;
}