#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin ("ssm.in");
ofstream fout ("ssm.out");

int n, x, i, j, minim, maxim, ans1, ans2, S[6000001];

int main()
{
    cin >> n;
    cin >> S[1];
    minim = S[1];
    maxim = S[1];
    for (i = 2; i <= n; i++)
    {
        cin >> x;
        S[i] = S[i - 1] + x;
        if (S[i] - minim > maxim)
        {
            maxim = S[i] - minim;
            ans1 = j + 1;
            ans2 = i;
        }
        if (minim > S[i])
        {
            minim = S[i];
            j = i;
        }
    }
    cout << maxim << " " << ans1 << " " << ans2;
    return 0;
}