#include <fstream>
#include <iostream>
#include <bitset>
using namespace std;

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

typedef long long ll;
int a[6000001], n;

void Solve ()
{
    int s, smax, p, st, dr;
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> a[i];
    st = p = dr = 1;
    s = smax = a[1];
    if (s < 0)
    {
        s = 0;
        p = 2;
    }
    for (int i = 2; i <= n; i++)
    {
        s += a[i];
        if (s > smax)
        {
            smax = s;
            st = p;
            dr = i;
        }
        if (s < 0)
        {
            s = 0;
            p = i + 1;
        }
    }
    fout << smax << " " << st << " " << dr << "\n";
    fout.close();
}

int main()
{
    Solve();
    return 0;
}