#include <bits/stdc++.h>

using namespace std;

const int LMAX = 6000005;

int v[LMAX], sum[LMAX], best[LMAX], n, minim, bestSum = INT_MIN, inceput, sfarsit;

int main()
{
    ifstream cin ("ssm.in");
    ofstream cout ("ssm.out");
    cin >> n;
    for (int i = 1; i <= n; ++i)
    {
        cin >> v[i];
        sum[i] = sum[i-1] + v[i];
    }

    for (int i = 1; i <= n; ++i)
    {
        best[i] = sum[i] - minim;
        if (minim > sum[i])
        {
            minim = sum[i];
            inceput = i + 1;
        }
        if (bestSum < best[i])
        {
            bestSum = best[i];
            sfarsit = i;
        }
    }
    cout << bestSum << ' ' << inceput << ' ' << sfarsit << '\n';
    return 0;
}