#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a[6000001],sum[6000001],best[6000001],inc,sf,id;
int main()
{
    f>>n;
    for(int i=1;i<=n;i++)
        f>>a[i];
    sum[0]=0;
    for(int i=1;i<=n;i++)
        sum[i]=a[i]+sum[i-1];
    int mini=sum[0],bestSum=-(1<<31);
    for(int i=1;i<=n;i++)
    {
        best[i]=sum[i]-mini;
        if(mini>sum[i])
            mini=sum[i],id=i;
        if(bestSum<best[i])
            bestSum=best[i],inc=id+1,sf=i;
    }
    g<<bestSum<<" "<<inc<<" "<<sf;
    return 0;
}