#include <fstream>
#include <algorithm>

using namespace std;

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

int i, n, st = 1, best = -1, el, bestst, bestdr, s = 0;

int main()
{
    f >> n;

    for (i = 1; i <= n; ++ i)
    {
        f >> el;

        s += el;

        if (s < 0)
        {
            st = i + 1;
            s = 0;
        }

        if (s > best)
        {
            bestst = st;
            bestdr = i;
            best = s;
        }
    }

    g << best << " " << bestst << " " << bestdr << '\n';
    return 0;
}