#include <fstream>

using namespace std;
int v[6000001];
int n, imaxim, jmaxim, suma, i, j, k, maxim = -(1<<31);
int main (){
    ifstream fin ("ssm.in");
    ofstream fout("ssm.out");

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

    /// solutia 1
    /// punem in evidenta toate secventele posibile si apoi calculam la fiecare
    /// dintre ele suma

    for (i=1;i<=n;i++){
        suma = 0;
        for (j=i;j<=n;j++) {
            suma += v[j];
            if (suma > maxim) {
                maxim = suma;
                imaxim = i;
                jmaxim = j;
            }
        }
    }
    fout<<maxim<<" "<<imaxim<<" "<<jmaxim<<"\n";
    return 0;
}