#include <fstream>
using namespace std;
long long best[6000001], sum[6000001];
long long n, i, x, minim, bestsum, c, d;

int main () {
    ifstream fin ("ssm.in");
    ofstream fout ("ssm.out");
    fin>>n;
    sum[0]=0;
    for (i=1;i<=n;i++) {
        fin>>x;
        sum[i]=x+sum[i-1];
    }
    minim=sum[0];
    bestsum=-2000000000000;
    for (i=1;i<=n;i++) {
        best[i]=sum[i]-minim;
        if (minim>sum[i]) {
            minim=sum[i];
            c=i;
        }
        if (bestsum<best[i]) {
            bestsum=best[i];
            d=i;
        }
    }

    fout<<bestsum<<" "<<c+1<<" "<<d;
    return 0;
}