#include<bits/stdc++.h>

using namespace std;

#define MAX 6000006

long long best[MAX],v[MAX];

int main(){
    ifstream in("ssm.in");
    ofstream out("ssm.out");
    int n;
    in >> n;

    for(int i = 1 ; i <= n ; i++)
        in >> v[i];
    long long mn = 0,mx=-int(2e9);
    int start = 1 , idx = 1 ,finish;
    for(int i = 1 ; i <= n ; i ++)
        v[i] +=v[i-1];

    for(int i = 1 ; i <= n ; i++){
        best[i] = v[i] - mn ;
        if(mn > v[i]){
            mn = v[i];
            idx = i+1;
        }
        if(best[i] > mx){
            mx = best[i];
            start = idx;
            finish = i ;
        }
    }

    out << mx << " " << start << " " << finish ;


}