#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream f ("ssm.in");
ofstream t ("ssm.out");

int main()
{int n, x, max,pos=0,sf;
    f >> n;
    vector <int> v(n);
    f >> v[0];
    max = v[0];
    for (int i = 1; i < n; ++i)
    {
        f >> x;
        if (v[i-1]+x > x)
            v[i] = v[i - 1] + x;
        else
            v[i] = x;
        if (v[i] > max)
        {
            max = v[i];
            pos = i;
        }
    }
    sf = pos;
    while (v[pos-1] >= 0)
    {
        --pos;
    }
    t << max<<" "<<pos+1<<" "<<sf+1;
    return 0;
}