#include <bits/stdc++.h>

using namespace std;
using int64 = long long;
const int N_MAX = 6e6;
const int64 myINF = 3e9;

int N; int v[1 + N_MAX];

ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
   fin >> N;
   for (int i = 1; i <= N; i ++)
      fin >> v[i];

   int64 sum = 0, min_sum = 0; int j = 1;
   int64 answer = -myINF; int left, right;

   for (int i = 1; i <= N; i ++) {
      sum += v[i];
      int64 candidate = sum - min_sum;
      if (candidate > answer) {
        answer = candidate;
        left = j;
        right = i;
      }
      else if (candidate == answer && j < left) {
        left = j;
        right = i;
      }

      if (sum < min_sum) {
        min_sum = sum;
        j = i + 1;
      }
   }
   fout << answer << " " << left << " " << right;
    return 0;
}