#include<cstdio>
#include<algorithm>
using namespace std;
int n,i,j,p,q,s[6000005],v[6000005],maxx;
int main()
{
    freopen("ssm.in","r",stdin);
    freopen("ssm.out","w",stdout);
    scanf("%d",&n);
    for (i=1;i<=n;i++) scanf("%d",&v[i]),s[i]=s[i-1]+v[i];
    for (i=1;i<=n;i++) for (j=i+1;j<=n;j++)
    if (s[j]-s[i-1]>maxx) maxx=s[j]-s[i-1],p=i,q=j;
    printf("%d %d %d",maxx,p,q);
    return 0;
}