#include <bits/stdc++.h>

using namespace std;

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

/// VARIANTA 1


/*

const int Nmax = 6000006;

int s[Nmax], v[Nmax];

int main()
{
    int n;
    fin >> n;

    for (int i = 1; i <= n; ++i)
    {
        fin >> v[i];
        s[i] = s[i - 1] + v[i];
    }

    int mini_sum = 0, bestSum = -2000000010;
    int poz_st = 0, poz_dr = 1, poz_inceput = 0;

    for (int i = 1; i <= n; ++i)
    {
        int current_sum = s[i] - mini_sum;

        if (current_sum > bestSum || (current_sum == bestSum && i - poz_inceput < poz_dr - poz_st))
        {
            bestSum = current_sum;
            poz_st = poz_inceput;
            poz_dr = i;
        }

        if (s[i] < mini_sum)
        {
            mini_sum = s[i];
            poz_inceput = i;
        }
    }

    fout << bestSum << " " << poz_st + 1 << " " << poz_dr;

    return 0;
}
*/

/// VARIANTA 2 - KADANE


int main()
{
    int n;
    fin >> n;
    int v[n + 1];
    for(int i = 1; i <= n; ++i)
        fin >> v[i];
    int start = 1 , stop = 1, summax = v[1] , sum = v[1], startc = 1;
    for(int i = 2 ; i <= n ; ++i)
    {
        if(sum < 0)
            sum = v[i] , startc = i;
        else
            sum += v[i];

        if(sum > summax)
        {
            summax = sum;
            start = startc;
            stop = i;
        }

    }
    fout << summax << " " << start << " " << stop;
    return 0;
}