#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;

int main()
{
  ifstream cin("feel.in");
  for (int n;cin>>n,n!=0;){
    vector<long long> v(n);
    for (int i=0;i<n;i++) cin>>v[i];
    vector<pair<long long,int> > ord(n);
    for (int i=0;i<n;i++){
      ord[i].first=v[i];
      ord[i].second=i;
    }
    sort(ord.begin(),ord.end());
    vector<long long> sum(n+1);
    long long t=0;
    for (int i=0;i<n+1;i++){
      sum[i]=t;
      if (i!=n)
        t+=v[i];
    }
    set<int> split;
    split.insert(-1);
    split.insert(n);

    long long ans=-1;
    int ans_l,ans_u;
    
    for (int i=0;i<n;i++){
      long long a=ord[i].first;
      int j=ord[i].second;
      set<int>::iterator p=split.lower_bound(j);
      int u=*p,l=*(--p)+1;
      long long val=a*(sum[u]-sum[l]);
      if (ans<val){
        ans=val;
        ans_l=l,ans_u=u;
      }
      split.insert(j);
    }
    cout<<ans<<endl;
    cout<<ans_l+1<<" "<<ans_u<<endl;
  }
  return 0;
}