#include <iostream>
#include <fstream>
#define N 6000001
using namespace std;

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

int v[N], aux[N];

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

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

  int max = 1, maxp = 1, prim;

  v[0] = -1;
  for (int i = 1; i <= n; i++) {
    if (aux[i-1] < 0) {
      aux[i] = v[i];
      prim = i;
    } else {
      aux[i] = aux[i-1] + v[i];
    }

    //cout << i << " " << aux[i] << "\n";

    if(aux[i] > aux[max]) {
      max = i;
      maxp = prim;
    }
  }

  fout << aux[max] << " " << maxp << " " << max;

  fin.close();
  fout.close();
  return 0;
}