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

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

int main(){
    
    int n, v[100], st = 1, dr = 1, stF;
    v[0] = 0;
    fin >> n;
    
    bool deja = false;
    int best = -100000;
    for( int i = 1 ; i <= n ; ++i ){
        fin >> v[i];
        if( v[i-1] > 0 ){
            v[i] += v[i-1];
            
            if( !deja ){
                deja = true;
                st = i - 1;
            }
            
        }else deja = false;
        if( v[i] > best ){
            stF = st;
            dr = i;
            best = v[i];
        }
    }
    
    fout << best << " " << stF << " " <<  dr;
    
    
    return 0;
}