#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");
int N, s;

int main(void) {
  fin >> N;
  int sum = 0, beg, end, idx, mx = -int(2e9);
  rep(i, N) {
    fin >> s;
    if (sum < 0) {
      sum = s;
      idx = i;
    } else {
      sum += s;
    }
    if (sum > mx) {
      mx = sum;
      beg = idx;
      end = i;
    }
  }
  fout << mx << ' ' << beg+1 << ' ' << end+1 <<  '\n';
  return 0;
}