#include <stdio.h>
#include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < n; i++)
#define repa(i, l, r) for (int i = l; i < r; i++)
#define repd(i, r, l) for (int i = r; i > l; i--)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
const int Nmax = 6000666;
int N, a[Nmax];

int main(void) {
  fin >> N;
  rep(i,N) {
    fin >> a[i];
  }
  int pre = 0, pos = -1, l = -1, cur = 0, r = -1, mx = -int(2e9);
  rep(i,N) {
    cur += a[i];
    if (cur - pre > mx) {
      mx = cur - pre;
      l = pos + 1;
      r = i;
    }
    if (pre > cur) { // minimum prefix of the sequence
      pre = cur;
      pos = i;
    }
  }
  fout << mx << ' ' << l+1 << ' ' << r+1 << '\n';

  return 0;
}