#include<fstream>
using namespace std;
const int maxn=6000005;
int v[maxn],n;
int main()
{
    ifstream fin("ssm.in");
    ofstream fout("ssm.out");
	int bestSum=-9999,min=0,idx,beg,end;
	fin>>n;
    for(int i=1;i<=n;++i)
		fin>>v[i];
    for(int i=1;i<=n;++i) 
	{
        v[i]=v[i]+v[i-1];
        if(bestSum<v[i]-min)
		{
            bestSum=v[i]-min;
			beg=idx+1;
			end=i;
		}
        if(min>v[i])
		{
            min=v[i];
			idx=i;
		}
    }
    fout<<bestSum<<" "<<beg<<" "<<end;
    return 0;
}