#include <cstdio>
int n, minPartial, minPartialStart, bestSum, from, to;

void solve() {
  scanf("%d", &n);
  int x, sum = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    sum += x;
    if (i == 1) {
      bestSum = x; from = to = 1;
    }
    
    if (sum - minPartial > bestSum) {
      bestSum = sum - minPartial;
      from = minPartialStart + 1; to = i;
    }
    
    if (sum < minPartial) {
      minPartial = sum;
      minPartialStart = i;
    }
  }
  printf("%d %d %d\n",  bestSum, from, to);
}

int main() {
  freopen("ssm.in", "r", stdin);
  freopen("ssm.out", "w", stdout);
  
  solve();
  return 0;
}