#include <iostream>
#include <fstream>
#define MAXN 6000000
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");

int best[MAXN], n, v[MAXN], maximum, start[MAXN], poz;

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

    best[0] = maximum = v[0];
    start[0] = 0;

    for (int i = 1; i < n; i++)
    {
        if (best[i - 1] <= 0)
            best[i] = v[i], start[i] = i;
        else
            best[i] = best[i - 1] + v[i], start[i] = start[i - 1];
        if (best[i] > maximum)
            maximum = best[i], poz = i;
    }

    fout << maximum << " " << start[poz] + 1 << " " << poz + 1;

    fin.close();
    fout.close();
    return 0;
}