#include <iostream>
#include <fstream>

using namespace std;

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

int n, i, v[6000002], best[6000002], st, dr, poz, maxim = -9999999999, suma;

int main()
{
   f >> n;
    for (i=1; i<=n; i++)
          f >> v[i];
    for (i=1; i<=n; i++)
        {
        best[i] = max(v[i], best[i-1] + v[i]);
           if (best[i] > maxim)
           {
            maxim = best[i];
            poz = i;
           }
        }
    suma = best[poz];
    suma -= v[poz];
    dr = poz;
    st = poz;
    i = poz - 1;
      while (best[i] == suma)
      {
            st = i;
            suma -= v[i];
            i --;
    }
    g << maxim << " " << st << " " << dr;

    return 0;
}