#include <iostream>
#include <vector>
#include <fstream>
#include <cmath>
#include <algorithm>

using namespace std;

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

int main()
{
    int n;
    in>> n;
    vector<int> v(n), S(n, 0);

    for (int i = 0; i < n; i++)
        in>> v[i];

    S[0] = v[0];
    for (int i = 1; i < n; i++)
        S[i] = S[i - 1] + v[i];

    int Min = S[0], Max = S[0], iR = 0, jR = 0, imin = 0;

    for (int i = 1; i < n; i++)
    {
        if (S[i] < Min)
        {
            Min = S[i];
            imin = i;
        }
        if (S[i] > Max)
        {
            Max = S[i];
            iR = 0; jR = i;
        }
        if (S[i] - Min > Max && Min != S[i])
        {
            Max = S[i] - Min;
            iR = imin + 1; jR = i;
        }

    }
    out<< Max << " " << iR + 1 << " " << jR + 1;

    return 0;
}