// solutie faina, cu dinamica
// modificata de pe https://infoarena.ro/job_detail/257846
#include <bits/stdc++.h>
using namespace std;

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

const int MAXN = 7000005;

int main() {
  int n, S;
  int bestSum = -int(2e9), sum = 0, beg, end, idx;
  fin >> n;
  for (int i = 1; i <= n; ++i) {
    fin >> S;
    if (sum < 0)
      sum = S, idx = i;
    else
      sum += S;
    if (bestSum < sum)
      bestSum = sum, beg = idx, end = i;
  }
  fout << bestSum << ' ' << beg << ' ' << end;
  return 0;
}