#include <iostream>
#include <cstdio>

using namespace std;

int n,x[6000005];

int main()
{
    freopen("ssm.in","r",stdin);
    freopen("ssm.out","w",stdout);

    using namespace std;

    cin >> n;
    for(int i = 1; i <= n; i++)  cin >> x[i];

    int bestSum = -int(2e9), mini = 0,idx,first,last;
    for(int i = 1; i <= n; i++)
    {
        x[i] += x[i - 1];
        if (bestSum < x[i] - mini)
            bestSum = x[i] - mini, first = idx + 1, last = i;
        if (mini > x[i])
            mini = x[i], idx = i;
    }
    cout << bestSum << " " << first << " " << last;
    return 0;
}