#include <iostream>
#include <fstream>
using namespace std;

int n,i,l,r,a[6000000],v[9999999],sum[6000000],best[6000000],BestSum=-999999999,mi;
int main()
{

    ifstream f("ssm.in");
    ofstream g("ssm.out");
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>a[i];
        sum[i]=sum[i-1]+a[i];
    }
    mi=sum[0];
    for(i=1;i<=n;i++)
    {
        best[i]=sum[i]-mi;
        if(v[best[i]]!=1)
        {
        if(mi>sum[i])
            {
                mi=sum[i];
                l=i+1;
            }
        if(BestSum<best[i])
        {
            BestSum=best[i];
            r=i;
            v[BestSum]=1;
        }
        }
        else
        {
            if(mi>sum[i])
                mi=sum[i];
        }
    }
    g<<BestSum<<" "<<l<<" "<<r;
    return 0;
}