#include <fstream>

using namespace std;

const int NMAX = 6000000;

int v[1 + NMAX];

int dp[1 + NMAX];
int start[1 + NMAX];

/// solutie cu programare dinamica

int main()
{
  ifstream in("ssm.in");
  ofstream out("ssm.out");

  int n;
  in >> n;

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

  dp[1] = v[1];
  start[1] = 1;

  for (int i = 2; i <= n; i++)
  {
    if (v[i] > dp[i - 1] + v[i])
    {
      dp[i] = v[i];
      start[i] = i;
    }
    else
    {
      dp[i] = dp[i - 1] + v[i];
      start[i] = start[i - 1];
    }
  }

  int maxim = dp[1];
  int indexMaxim = 1;

  for (int i = 2; i <= n; i++)
  {
    if (maxim < dp[i])
    {
      maxim = dp[i];
      indexMaxim = i;
    }
  }

  out << maxim << ' ' << start[indexMaxim] << ' ' << indexMaxim << '\n';

  return 0;
}