//Subsecventa de suma maxima
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("date.in");
ofstream fout("date.out");
int n, v[100], s[100], a, b, c, d;
int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>v[i];
        s[i]=s[i-1]+v[i];
    }
    a=max_element(s+1, s+n+1)-s;
    b=min_element(s+1, s+a)-s;
    c=min_element(s+a+1, s+n+1)-s;
    d=max_element(s+c+1, s+n+1)-s;
    if(s[a]-s[b]>s[d]-s[c])
        fout<<s[a]-s[b]<<' '<<b+1<<' '<<a;
    else
        fout<<s[d]-s[c]<<' '<<c+1<<' '<<d;
    fin.close();
    fout.close();
    return 0;
}