#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[10000], s[10000], maxi, i,j,p, n;
int main() {
  f >> n;
  for (i = 1;i <= n;i++) {
    f >> a[i];
    s[i] = max(a[i], (s[i-1] + a[i]));
    if (maxi < s[i]) {
      maxi = s[i];
      j = i;
    }
  }
p=j;
for(i=j;i>=1;i--)
  if(s[i]>0) p--;
     else break;
     g<<maxi<<'\n';
  g<<p+1<<" "<<j<<'\n';
  f.close ();
  g.close ();
  return 0;
}