#include <fstream>
#include <algorithm>
using namespace std;
int n, v,dp,l,mx,r,i,last, ansl;
int main()
{
    ifstream f ("ssm.in");
    ofstream g ("ssm.out");
    f>>n;
    f>>v;
    dp=v;
    mx=dp;
    last=dp;
    r=1;
    for (i=2;i<=n;i++)
    {
        f>>v;
     dp=max(v,last+v);
     if (v>last+v)
        l=i;

     if (mx<dp)
     {
         mx=dp;
         r=i;
        ansl=l;
     }
     last=dp;
    }
    g<<mx<<" "<<ansl<<" "<<r;


    return 0;
}