#include <iostream>
#include <bitset>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[6000003], n;
int main()
{
    int i, j, st, dr, s, smax;
    fin >> n;
    for (i = 1; i <= n; i++)
        fin >> a[i];
    j = st = dr = 1;
    s = smax = a[1];
    if (s < 0)
    {
        j = 2;
        s = 0;
    }
    for (i = 2; i <= n; i++)
    {
        s += a[i];
        if (s > smax)
        {
            st = j;
            dr = i;
            smax = s;
        }
        if (s < 0)
        {
            j = i + 1;
            s = 0;
        }
    }
    fout << smax << " " << st << " " << dr;
    return 0;
}