#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;


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

int s[6000002], n, maxx, minn, st, en, poz;

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> s[i];
    maxx = -2000000000;
    for(int i = 1; i <= n; i++)
    {
        s[i] += s[i-1];
        if(s[i] - minn > maxx)
        {
            maxx = s[i] - minn;
            st = poz + 1;
            en = i;
        }
        if(s[i] < minn)
        {
            minn = s[i];
            poz = i;
        }
    }
    fout << maxx << " " << st << " " << en << "\n";
    return 0;
}