#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

int main(void) {
    int n, S;
    int bestSum = -99999, sum = 0, primul, ultimul, poz;
    fin>>n;
    for(int i=1; i<=n; i++)
    {
        fin>>S;
        if(sum < 0)
        {
            sum=S;
            poz=i;
        }
        else
            sum += S;
        if (bestSum < sum)
        {
            bestSum = sum;
            primul = poz;
            ultimul = i;
        }
    }
    fout<<bestSum << " " << primul << " " << ultimul;
    return 0;
}