#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "ssm";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int INF = (1 << 30);

int N;
int best, stop, start;

int main() {
    int i, x, I, sum = 0;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d", &N);

    best = -INF;

    for(i = 1; i <= N; i++) {
        scanf("%d", &x);

        if(sum + x < x) {
            sum = x;
            I = i;
        } else
            sum += x;

        if(best < sum) {
            best = sum;
            start = I;
            stop = i;
        }
    }

    printf("%d %d %d\n", best, start, stop);

    return 0;
}