#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int main()
{
    int n;
    f >> n;
    int v[n+n],d[n+n],sfarsit=0,maxs=-99999999;
    for (int i=1; i<=n; i++) f >> v[i];
    for (int i=1; i<=n; i++)
    {
        if (i==1) d[i] = v[i];
        else
            d[i] = max(0,d[i-1]) + v[i];

    }
    for (int i=1; i<=n; i++) if (d[i] > maxs)
        {
            maxs=d[i];
            sfarsit=i;
        }
    int ts =0;
    for (int i=sfarsit; i>=1; i--)
    {
        ts+=v[i];
        if (ts == d[sfarsit])
        {
            ts = i;
            break;
        }
    }
    g << maxs << ' ' << ts << ' ' << sfarsit;
    return 0;
}