// https://goo.gl/fBmFxu
#include <bits/stdc++.h>
using namespace std;

#define NMAX        100009
#define MMAX        200009
#define kInf        (1 << 30)
#define kInfLL      (1LL << 60)
#define kMod        666013
#define edge pair<int, int>
#define x first
#define y second

#define USE_FILES "MLC"

#ifdef USE_FILES
#define cin fin
#define cout fout
ifstream fin("ssm.in");
ofstream fout("ssm.out");
#endif

// number of tests from "in"
int test_cnt = 1;
void clean_test();

// your global variables are here
int N, start, finish, x, aux;
long long sum, best = -(1LL << 60);

// your solution is here
void solve() {
    cin >> N;
    for (int i = 1; i <= N; ++i) {
        cin >> x;
        if (sum < 0) {
            sum = x;
            aux = i;
        } else {
            sum += x;
        }
        
        if (best < sum) {
            start = aux;
            finish = i;
            best = sum;
        }
    }
    
    cout << best << ' ' << start << ' ' << finish << '\n';

    if (test_cnt > 0) {
        clean_test();
    }
}


void clean_test() {
    // clean if needed
}

int main() {
//     cin >> test_cnt;
    while (test_cnt--) {
        solve();
    }

    return 0;
}