#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];

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

    int s = 0, best = numeric_limits<int>::lowest();
    int x = -1, bestx = -1, besty = -1;
    for (int i = 1; i <= n; i++)
    {
        s += a[i];
        if (s < 0)
            s = 0, x = i + 1;
        else if (s > best)
            best = s, bestx = x, besty = i;
    }

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

    return 0;
}