#include <iostream>
#include <algorithm>
#include <fstream>

using namespace std;

ifstream fin("ssm.in");
ofstream fout("ssm.out");

constexpr long long NMAX = 6000001;

int a[NMAX], sp[NMAX];

int main()
{
    int n;
    fin >> n;
    for (int i = 1; i <= n; i++)
    {
        fin >> a[i];
        sp[i] = sp[i - 1] + a[i];
    }

    int s = 0, best = -2147483647, minelem = 1;
    int bestx = -1, besty = -1;
    for (int i = 1; i <= n; i++)
    {
        if (sp[i] - sp[minelem] > best)
            best = sp[i] - sp[minelem], bestx = minelem + 1, besty = i;

        if (sp[i] < sp[minelem])
            minelem = i;
    }

    fout << best << ' ' << bestx << ' ' << besty;

    return 0;
}