#include <fstream>
#include <queue>
#include <iostream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,x, i, sum,indice_inceput=1,indice_final=1,best_sum,secv_inc,secv_fin;
int v[6000001],maxim=-500000;

int main()
{
    fin>>n;
    for (int i = 1 ; i<=n;i++){
        fin>>x;
        v[i]=v[i-1]+x;
    }
    for (int i = 0 ; i<=n;i++)
    {
        for (int j =i+1 ; j<=n;j++)
        {
            if (v[j]-v[i]>maxim) {
                maxim = v[j]-v[i];
                indice_inceput=i+1;
                indice_final=j;
            }

        }
    }
    fout<<maxim<<" "<<indice_inceput<<" "<<indice_final;
    return 0;
}