#include <bits/stdc++.h>

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

const int Nmax = 6000005;


int s[Nmax], v[Nmax], best;
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, poz_st = 0, poz_dr= 1;
    for(int i = 1; i <= n; ++i)
    {
        best = s[i] - mini_sum;

         if (mini_sum > s[i])
         {
             mini_sum = s[i];
             poz_st = i;
         }


         if (bestSum < best)
         {
            bestSum = best;
            poz_dr = i;
         }

    }
    fout << bestSum << " " << poz_st + 1 << " " << poz_dr;
    return 0;
}