#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "ssm.in";
const char outfile[] = "ssm.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 100005;
const int oo = 0x3f3f3f3f;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

int N;

int main() {
    fin >> N;
    int bestSum = -oo, sum = 0, _beg, _end, idx;
    for(int i = 1 ; i <= N ; ++ i) {
        int x;
        fin >> x; /// best[i] = max(best[i - 1] + x, x);
        if(sum < 0){
            sum = x;
            idx = i;
        } else sum += x;
        if(bestSum < sum) {
             bestSum = sum;
             _beg = idx;
             _end = i;
        }
    }
    fout << bestSum << ' ' << _beg << ' ' << _end << '\n';
    fin.close();
    fout.close();
    return 0;
}