#include <bits/stdc++.h>
  
using namespace std;
  
#if 1
    #define pv(x) cout<<#x<<" = "<<(x)<<"; ";cout.flush()
    #define pn cout<<endl
#else
    #define pv(x)
    #define pn
#endif
  
// #if 1
#ifdef INFOARENA
    ifstream in("ssm.in");
    ofstream out("ssm.out");
#else
    #define in cin
    #define out cout
#endif
  
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pld = pair<ld, ld>;
using pdd = pair<double, double>;
#define pb push_back
const long double PI = 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862;
const long double EPS = 1e-8;
const int inf_int = 1e9 + 5;
const ll inf_ll = 1e18 + 5;
const int NMax = 6e6 + 5;
const int valMax = 3e5 + 500;
const int mod = 1e9 + 7;
const int dx[] = {-1,0,0,+1}, dy[] = {0,-1,+1,0};

int v[NMax], asum, aleft, aright;

void cmp(int sum, int lo, int hi) {
    bool good = false;

    if (asum < sum) {
        good = true;
    }
    else if (asum == sum) {
        if (lo < aleft) {
            good = true;
        }
        else if (lo == aleft) {
            if (hi < aright) {
                good = true;
            }
        }
    }

    if (good) {
        asum = sum;
        aleft = lo;
        aright = hi;
    }
}

void solve(int st, int dr) {
    if (st == dr) {
        cmp(v[st], st, st);
        return;
    }

    int mid = (st + dr) >> 1;
    solve(st, mid);
    solve(mid + 1, dr);

    int maxLeft = -inf_int, sum = 0, leftIdx;
    for (int i = mid; i >= st; --i) {
        sum += v[i];
        if (maxLeft <= sum) {
            maxLeft = sum;
            leftIdx = i;
        }
    }

    int maxRight = -inf_int, rightIdx;
    sum = 0;
    for (int i = mid + 1; i <= dr; ++i) {
        sum += v[i];
        if (maxRight < sum) {
            maxRight = sum;
            rightIdx = i;
        }
    }

    cmp(maxLeft + maxRight, leftIdx, rightIdx);
}

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);

    int N;
    in >> N;
    for (int i = 1; i <= N; ++i) {
        in >> v[i];
    }

    solve(1,N);
    out << asum << ' ' << aleft << ' ' << aright << '\n';

    return 0;
}