#include <fstream>

using namespace std;

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

const int NMAX = 6 * (1e6);
int v[NMAX + 5];

int main()
{
    int n;
    fin >> n;

    for(int i = 1; i <= n; i++)
        fin >> v[i];

    int st, fini = 0, start = 0, finish = 0;
    long long s = 0, maxim = INT_MIN;

    for(int i = 1; i <= n; i++)
    {
        if(s + v[i] < v[i])
        {
            st = i;
            s = v[i];
        }
        else
        {
            s += v[i];
            fini = i;
        }

        if(maxim < s)
        {
            start = st;
            finish = fini;
            maxim = s;
        }
        else if(maxim == s)
        {
            if(fini - st < finish - start)
            {
                start = st;
                finish = fini;
            }
        }
    }

    fout << maxim << ' ' << start << ' ' << finish;

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