/*
ID: gabriel100
LANG: C++
TASK:
*/
#include <cstdio>
#include <algorithm>
//#include <time.h>
#include <queue>
#include <cmath>
#include <stack>
#include <fstream>
#include <bitset>
#include <set>

#define nl '\n'
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define eb(x) emplace_back(x)
#define ull unsigned long long
#define ll long long
#define ProblemName "ssm"
#define LocalName "data"
#ifdef INFOARENA
#define Filename ProblemName
#else
#define Filename LocalName
#endif
#define Input Filename".in"
#define Output Filename".out"
#define MOD 32173
#define N 21
using namespace std;
ifstream cin(Input);
ofstream cout(Output);

template<class a, class type>
void print(a v, type t) {
    for_each(all(v), [](type x) { cout << x.first << ' '; });
    cout << nl;
}

int n, suma, sumaMax, st, dr, a, stM, drM;

int main() {
    //    clock_t tStart = clock();
    ios_base::sync_with_stdio(false);
    cin >> n;
    cin >> a;
    suma = sumaMax = a;
    st = drM = 1;
    for (int i = 2; i <= n; ++i) {
        cin >> a;
        if (a > suma + a)
            suma = a, st=i;
        else
            suma += a;
        if (suma > sumaMax) {
            sumaMax = suma;
            stM = st;
            drM = i;
        }
    }
    cout << sumaMax << ' ' << stM << ' ' << drM << nl;
    //    printf("\nTime taken: %.2fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
    cout.close();
}