#include <bits/stdc++.h>
using namespace std;

const int MAXN = 6000010;

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

int n, a[MAXN], d[MAXN], pp, ib, jb, maxim;

int main()
{
    fin >> n;
    for (int i = 1; i <= n; ++i)
    {
        fin >> a[i];
    }
    d[1] = a[1];
    ib = jb = 1;
    maxim = a[1];
    pp = 1;
    for (int i = 2; i <= n; ++i)
    {
        if (d[i - 1] + a[i] >= a[i])
        {
            d[i] = d[i - 1] + a[i];
        }
        else
        {
            d[i] = a[i];
            pp = i;
        }
        if (d[i] > maxim)
        {
            maxim = d[i];
            ib = pp;
            jb = i;
        }
    }
    fout << maxim << " " << ib << " " << jb;
    return 0;
}